Abstract
3Spin and 3Murphi are modified versions of the Spin model checker and the MurĪ verifier. Our modifications enhance the probabilistic algorithms and data structures for storing visited states, making them more effective and more usable for verifying huge transition systems. The tools also support a verification methodology designed to minimize time to finding errors, or to reaching desired certainty of error-freedom. This methodology calls for bitstate hashing, hash compaction, and integrated analyses of both to provide feedback and advice to the user. 3Spin and 3Murphi are the only tools to offer this support, and do so with the most powerful and flexible currently-available implementations of the underlying algorithms and data structures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cousin, B., HÊlary, J.: Performance improvement of state space exploration by regular and differential hashing functions. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 364â376. Springer, Heidelberg (1994)
Dillinger, P.C.: 3Murphi Home Page, http://www.cc.gatech.edu/~peterd/3murphi/
Dillinger, P.C.: 3Spin Home Page, http://www.cc.gatech.edu/~peterd/3spin/
Dillinger, P.C., Manolios, P.: Bloom filters in probabilistic verification. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 367â381. Springer, Heidelberg (2004)
Dillinger, P.C., Manolios, P.: Fast and accurate bitstate verification for SPIN. In: Graf, S., Mounier, L. (eds.) SPIN 2004. LNCS, vol. 2989, pp. 57â75. Springer, Heidelberg (2004)
Holzmann, G.J.: An analysis of bitstate hashing. In: Proc. 15th Int. Conf on Protocol Specification, Testing, and Verification, INWG/IFIP, pp. 301â314. Chapman & Hall, Boca Raton (1995)
Jenkins, B.: Algorithm alley: Hash functions. Dr. Dobbâs Journal (September 1997)
Stern, U., Dill, D.L.: Improved probabilistic verification by hash compaction. In: Camurati, P.E., Eveking, H. (eds.) CHARME 1995. LNCS, vol. 987, pp. 206â224. Springer, Heidelberg (1995)
Stern, U., Dill, D.L.: A new scheme for memory-efficient probabilistic verification. In: FORTE/PSTV, pp. 333â348 (1996)
Wolper, P., Leroy, D.: Reliable hashing without collision detection. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 59â70. Springer, Heidelberg (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Š 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dillinger, P.C., Manolios, P. (2005). Enhanced Probabilistic Verification with 3Spin and 3Murphi. In: Godefroid, P. (eds) Model Checking Software. SPIN 2005. Lecture Notes in Computer Science, vol 3639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537328_22
Download citation
DOI: https://doi.org/10.1007/11537328_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28195-5
Online ISBN: 978-3-540-31899-6
eBook Packages: Computer ScienceComputer Science (R0)