%0 Conference Proceedings
%T Exploiting Hub States in Automatic Verification
%A Della Penna, Giuseppe
%A Intrigila, Benedetto
%A Melatti, Igor
%A Tronci, Enrico
%Y D.A. Peled
%Y Y.-K. Tsay
%S Automated Technology for Verification and Analysis: Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings
%S Lecture Notes in Computer Science
%D 2005
%V 3707
%I Springer
%@ 3-540-29209-8
%F DellaPenna_etal2005
%O exported from refbase (http://mclab.di.uniroma1.it/publications/show.php?record=83), last updated on Sat, 24 Nov 2012 14:17:53 +0100
%X In this paper we present a new algorithm to counteract state explosion when using Explicit State Space Exploration to verify protocol-like systems. We sketch the implementation of our algorithm within the Caching Mur$\varphi$ verifier and give experimental results showing its effectiveness. We show experimentally that, when memory is a scarce resource, our algorithm improves on the time performances of Caching Mur$\varphi$ verification algorithm, saving between 16% and 68% (45% on average) in computation time.
%R 10.1007/11562948_7
%U http://mclab.di.uniroma1.it/publications/papers/papers/Della Penna2005.pdf
%U https://doi.org/10.1007/11562948_7
%P 54-68