A light-weight algorithm for model checking with symmetry reduction and weak fairness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2648, Issue , 2003, Pages 89-103

  Bošnački, Dragan ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM DEBUGGING;

DEPTH FIRST SEARCH; EXPLICIT STATE; FALSE POSITIVE; MODEL CHECKING ALGORITHM; PROTOTYPE IMPLEMENTATIONS; STATE-SPACE REDUCTION; SYMMETRY REDUCTION; SYSTEMATIC DEBUGGING;

MODEL CHECKING;

EID: 35248875278     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44829-2_6     Document Type: Article

References (22)

1. A.V. Aho, J.E. Hopcroft, J.D. Ulmann, The design and Analysis of Computer Algorithms, Addison Wesley, 1974.
2. D. Bošnački, Partial Order Reduction in Presence of Rendez-vous Communications with Unless Constructs and Weak Fairness, Theoretical and Practical Aspects of SPIN Model Checking, 5th and 6th International SPIN Workshops, LNCS 1680, pp. 40-56, Springer, 1999.
3. D. Bošnački, Enhancing State Space Reduction Techniques for Model Checking, p. 146, Ph.D. Thesis, Eindhoven University of Technology, ISBN 90-386-0951-5, 2001.
4. D. Bošnački, A Nested Depth First Search Algorithm for Model Checking with Symmetry Reduction, Proc. of FORTE'02, LNCS, Springer, 2002.
5. D. Bosnacki, D. Dams, L. Holenderski, Symmetric Spin, 7th Int. SPIN Workshop on Model Checking of Software SPIN 2000, pp. 1-19, LNCS 1885, Springer, 2000.
6. Y. Choueka, Theories of Automata on w-tapes: a Simplified Approach, Journal of Computer and System Science, Vol. 8, pp. 117-141, 1974.
7. E. M. Clarke, Jr., O. Grumberg, D. A. Peled, Model Checking, The MIT Press, 2000.
8. C. Courcoubetis, M. Vardi, P. Wolper, M. Yannakakis, Memory Efficient Algorithms for the Verification of Temporal Properties, Formal Methods in System Design I pp. 275-288, 1992.
9. J.-M. Couvreur, On-the-fly Verification of Linear Temporal Logic, Proc. of FM'99, pp. 253-271, LNCS 1708, 1999.
10. E. A. Emerson, Temporal and Modal Logic, in J. van Leeuwen (ed.), Formal Models and Semantics, pp. 995-1072, Elsevier, 1990.
11. E. A. Emerson, A. P. Sistla, Symmetry and model checking, Proc. of CAV'93 (Computer Aided Verification), LNCS 697, pp. 463-478, Springer, 1993.
12. E. A. Emerson, A. P. Sistla, Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata Theoretic Approach, Proc. of CAV'95 (Computer Aided Verification), LNCS 697, pp. 309-324, Springer, 1995.
13. E. A. Emerson, S. Jha, D. Peled, Combining partial order and symmetry reductions, in Ed Brinksma (ed.), Proc. of TACAS'97 (Tools and Algorithms for the Construction and Analysis of Systems), LNCS 1217, pp. 19-34, Springer, 1997.
14. N. Francez, Fairness, Springer, 1986.
15. V. Gyuris, A. P. Sistla, On-the fly model checking under fairness that exploits symmetry, in O. Grumberg (ed.), Proc. of CAV'97 (Computer Aided Verification), LNCS 1254, pp. 232-243, Springer, 1997.
16. G. J Holzmann, Design and Validation of Communication Protocols, Prentice Hall, 1991. Also: http://netlib.bell-labs.com/netlib/spin/whatispin.html.
17. G. Holzmann, D. Peled, An Improvement in Formal Verification, FORTE 1994, Bern, Switzerland, 1994.
18. G. Holzmann, D. Peled, M. Yannakakis, On Nested Depth First Search, Proc. of the 2nd Spin Workshop, Rutgers University, New Jersey, USA, 1996.
19. C. N. Ip, D. L. Dill, Better verification through symmetry. Formal Methods in System Design, Vol. 9, pp. 41-75, 1996.
20. W. Thomas, Automata on Infinite Objects, in J. van Leeuwen (ed.), Formal Models and Semantics, pp. 995-1072 Elsevier, 1990.
21. M. Vardi, P. Wolper, Automata Theoretic Techniques for Modal Logics of Programs, Journal of Computer and System Science, 32(2), pp. 182-221, 1986.
22. P.Wolper, D. Leroy, Reliable Hashing without Collision Detection, Proc. of CAV'93 (Computer Aided Verification), LNCS 697, pp. 59-70, Springer, 1993.