A nested depth first search algorithm for model checking with symmetry reduction

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

Volumn 2529 LNCS, Issue , 2002, Pages 65-80

  Bošnački, Dragan ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Model checking; Multiple representatives; Nested depth first search algorithm; State space reduction techniques; Symmetry reduction

Indexed keywords

EQUIVALENCE CLASSES; LEARNING ALGORITHMS; PROGRAM DEBUGGING; SPACE RESEARCH;

COUNTER EXAMPLES; DEPTH-FIRST SEARCH ALGORITHM; MODELS CHECKING; MULTIPLE REPRESENTATIVES; NESTED DEPTH FIRST SEARCH ALGORITHM; REDUCTION TECHNIQUES; STATE SPACE REDUCTION TECHNIQUE; STATE-SPACE; STATE-SPACE REDUCTION; SYMMETRY REDUCTION;

MODEL CHECKING;

EID: 35248856679     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36135-9_5     Document Type: Conference Paper

References (18)

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 and Symmetry Reductions for Discrete Time, to appear in Proc. of RT-TOOLS ’02, Copenhagen, Denmark, 2002.
3. D. Bošnački, D. Dams, L. Holenderski, Symmetric Spin, 7th Int. SPIN Workshop on Model Checking of Software SPIN 2000, pp. 1–19, LNCS 1885, Springer, 2000.
4. E.M. Clarke, R. Enders, T. Filkorn, S. Jha, Exploiting Symmetry in Temporal Logic Model Checking, Formal Methods in System Design, Vol. 19, 77–104, 1996.
5. E.M. Clarke, Jr., O. Grumberg, D.A. Peled, Model Checking, The MIT Press, 2000.
6. 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.
7. E.A. Emerson, Temporal and Modal Logic, in J. van Leeuwen (ed.), Formal Models and Semantics, pp. 995–1072, Elsevier, 1990.
8. E.A. Emerson, A.P. Sistla, Symmetry and model checking, Proc. of CAV’93 (Com-puter Aided Verification), LNCS 697, pp. 463–478, Springer, 1993.
9. E.A. Emerson, A.P. Sistla, Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach, ACM Transactions on Programming Languages and Systems, Vol. 19, 4, pp. 617–638, ACM Press, 1997.
10. 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.
11. 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.
12. G.J. Holzmann, Design and Validation of Communication Protocols, Prentice Hall, 1991. Also: http://netlib.bell-labs.com/netlib/spin/whatispin.html.
13. G. Holzmann, D. Peled, M. Yannakakis, On Nested Depth First Search, Proc. of the 2nd Spin Workshop, Rutgers University, New Jersey, USA, 1996.
14. R. Iosif, Symmetry Reduction Criteria for Software Model Checking, Model Checking Software, Proc. of SPIN 2002, LNCS 2318, pp. 22–41, Springer, 2002.
15. C.N. Ip, D.L. Dill, Better verification through symmetry. Formal Methods in System Design, Vol. 9, pp. 41–75, 1996.
16. W. Thomas, Automata on Infinite Objects, in J. van Leeuwen (ed.), Formal Models and Semantics, pp. 995–1072 Elsevier, 1990.
17. M. Vardi, P. Wolper, An automata-theoretic approach to automatic program verification. In Proc. of the 1st Symposium on Logic in Computer Science LICS ’86, pp. 322–331, 1986.
18. P. Wolper, D. Leroy, Reliable Hashing without Collision Detection, Proc. of CAV’93 (Computer Aided Verification), LNCS 697, pp. 59–70, Springer, 1993.