Abstract
We give a detailed description of SymmSpin, a symmetry-reduction package for Spin. It offers four strategies for state-space reduction, based on the heuristic that we presented in [3], and a fifth mode for reference. A series of new experiments is described, underlining the effectiveness of the heuristic and demonstrating the generalisation of the implementation to multiple scalar sets, multiple process families, as well as almost the full Promela language.
This research has been supported by the VIRES project (Verifying Industrial Reactive Systems, Esprit Long Term Research Project #23498).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
AdjustPan script (April 2000), http://www.win.tue.nl/~lhol/SymmSpin
Bošnački, D., Dams, D.: Integrating real time into Spin: a prototype implementation. In: Budkowski, S., Cavalli, A., Najm, E. (eds.) Proc. of FORTE/PSTV 1998 (Formal Description Techniques and Protocol Specification, Testing and Verification), Paris, France, October 1998, pp. 423–438 (1998)
Bošnački, D., Dams, D., Holenderski, L.: A Heuristic for Symmetry Reductions with Scalarsets. In: FORTE 2000 (The 13th Int. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols) (2000) (submitted to)
Clarke, E.M., Enders, R., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. Formal Methods in System Design 19, 77–104 (1996)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)
Dravapoulos, I., Pronios, N., Denazis, S., et al.: The Magic WAND, Deliverable 3D2, Wireless ATM MAC (September 1997)
Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Formal Models and Semantic. Handbook of Theoretical Computer Science, vol. B, ch.16, pp. 995–1072. Elsevier/The MIT Press (1990)
Emerson, E.A., Jha, S., Peled, D.: Combining partial order and symmetry reduc- tions. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 19–34. Springer, Heidelberg (1997)
Emerson, E.A., Sistla, A.P.: Symmetry and model checking. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 463–478. Springer, Heidelberg (1993)
Emerson, E.A., Trefler, R.J.: Model checking real-time properties of symmetric systems. In: Proc. of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS), August 1998, pp. 427–436 (1998)
Emerson, E.A., Trefler, R.J.: From asymmetry to full symmetry: new techniques for symmetry reduction in model checking. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 142–157. Springer, Heidelberg (1999)
Emerson, E.A., Sistla, A.P.: Utilizing symmetry when model-checking under fai- rness assumptions: an automata-theoretic approach. ACM Transactions on Pro- gramming Languages and Systems 19(4), 617–638 (1997)
Feijen, W.H.J., van Gasteren, A.J.M.: On a method of multiprogramming. Springer, Heidelberg (1999)
Godefroid, P.: Exploiting symmetry when model-checking software. In: Proc. of FORTE/PSTV 1999 (Formal Methods for Protocol Engineering and Distributed Sy- stems), Beijing, October 1999, pp. 257–275 (1999)
Gyuris, V., Sistla, A.P.: On-the fly model checking under fairness that exploits symmetry. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 232–243. Springer, Heidelberg (1997)
Holzmann, G.J.: Design and Validation of Communication Protocols, Prentice Hall (1991), Also: http://netlib.bell-labs.com/netlib/spin/whatispin.html
Ip, C.N., Dill, D.L.: Better verification through symmetry. In: Agnew, D., Cla- esen, L.C., Camposano, R. (eds.) Proc. of the 1993 Conference on Computer Hardware Description Languages and their Applications (April 1993)
Ip, C.N., Dill, D.L.: Better verification through symmetry. Formal Methods in System Design 9, 41–75 (1996)
Ip, C.N.: State Reduction Methods for Automatic Formal Verification, PhD thesis, Department of Computer Science of Stanford University (December 1996)
Lipskiy, V.: Kombinatorika dlya programmistov, Mir, Moscow, (1988) (in Russian)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)
Nalumasu, R., Gopalakrishnan, G.: Explicit-enumeration based Verification made Memory-efficient. In: Proc. of CHDL 1995 (Computer Hardware Description Languages), Chiba, Japan, August 1995, pp. 617–622 (1995)
Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol. 483, pp. 491–515. Springer, Heidelberg (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bošnački, D., Dams, D., Holenderski, L. (2000). Symmetric Spin. In: Havelund, K., Penix, J., Visser, W. (eds) SPIN Model Checking and Software Verification. SPIN 2000. Lecture Notes in Computer Science, vol 1885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722468_1
Download citation
DOI: https://doi.org/10.1007/10722468_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41030-0
Online ISBN: 978-3-540-45297-3
eBook Packages: Springer Book Archive