From Pre-Historic to Post-Modern Symbolic Model Checking

Formal Methods in System Design

Volumn 23, Issue 3, 2003, Pages 303-327

  Henzinger, Thomas A ^a   Kupferman, Orna ^b   Qadeer, Shaz ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c HEWLETT PACKARD COMPANY   (United States)

Author keywords

calculus; regular specifications; Forward traversal; Symbolic model checking

Indexed keywords

CODES (SYMBOLS); FUNCTIONS; ITERATIVE METHODS; MATHEMATICAL MODELS; SPECIFICATIONS;

SYMBOLIC MODEL CHECKING;

LARGE SCALE SYSTEMS;

EID: 0345446617     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026228213080     Document Type: Article

References (30)

1. G. Bhat and R. Cleaveland, "Efficient model checking via the equational μ-calculus," in Proc. 11th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, 1996, pp. 304-312.
2. R.K. Brayton, G.D. Hachtel, A.L. Sangiovanni-Vincentelli, F. Somenzi, A. Aziz, S.-T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R.K. Ranjan, S. Sarwary, T.R. Shiple, G.M. Swamy, and T. Villa, "VIS: A system for verification and synthesis," in CAV 96: Computer Aided Verification, Lecture Notes in Computer Science 1102, Springer-Verlag, 1996, pp. 428-432.
3. M.C. Browne, E.M. Clarke, and O. Grumberg, "Characterizing finite Kripke structures in propositional temporal logic," Theoretical Computer Science, Vol. 59, pp. 115-131, 1988.
4. R.E. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Transactions on Computers, Vol. C-35, No. 8, pp. 677-691, 1986.
5. 20 states and beyond," Information and Computation, Vol. 98, No. 2, pp. 142-170, 1992.
6. E.M. Clarke and I.A. Draghicescu, "Expressibility results for linear-time and branching-time logics," in Workshop on Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science 354, Springer-Verlag, 1988, pp. 428-437.
7. E.M. Clarke and E.A. Emerson, "Design and synthesis of synchronization skeletons using branching-time temporal logic," in Workshop on Logic of Programs, Lecture Notes in Computer Science 131, Springer-Verlag, 1981, pp. 52-71.
8. E.M. Clarke, O. Grumberg, and K. Hamaguchi, "Another look at LTL model checking," in CAV 94: Computer Aided Verification, Lecture Notes in Computer Science 818, Springer-Verlag, 1994, pp. 415-427.
9. E.M. Clarke, O. Grumberg, and D.E. Long, "Verification tools for finite-state concurrent systems," in A Decade of Concurrency: Reflections and Perspectives, Lecture Notes in Computer Science 803, Springer-Verlag, 1994, pp. 124-175.
10. R. Cleaveland, M. Klein, and B. Steffen, "Faster model checking for the modal μ-calculus," in CAV 92: Computer Aided Verification, Lecture Notes in Computer Science 663, Springer-Verlag, 1992, pp. 410-422.
11. M. Dam, "CTL* and ECTL* as fragments of the modal μ-calculus," Theoretical Computer Science, Vol. 126, pp. 77-96, 1994.
12. D.L. Dill, "The Murφ verification system," in CAV 96: Computer Aided Verification, Lecture Notes in Computer Science 1102, Springer-Verlag, 1996, pp. 390-393.
13. E.A. Emerson and C. Lei, "Efficient model checking in fragments of the propositional μ-calculus," in Proc. First Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, 1986, pp. 267-278.
14. R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper, "Simple on-the-fly automatic verification of linear temporal logic," in Protocol Specification, Testing, and Verification, Chapman & Hall, 1995, pp. 3-18.
15. P. Godefroid, in Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem, Lecture Notes in Computer Science 1032, Springer-Verlag, 1996.
16. O. Grumberg and R.P. Kurshan, "How linear can branching time be?" in ICTL 94: International Conference on Temporal Logic, Lecture Notes in Artificial Intelligence 827, Springer-Verlag, 1994, pp. 180-194.
17. G.J. Holzmann, Design and Validation of Computer Protocols, Prentice-Hall, 1991.
18. G. Holzmann, D. Peled, and M. Yannakakis, "On nested depth-first search," Second SPIN Workshop, American Mathematical Society, 1996.
19. H. Iwashita and T. Nakata, "Forward model checking techniques oriented to buggy designs," in ICCAD 97: International Conference on Computer Aided Design, IEEE Computer Society Press, 1997, pp. 400-404.
20. H. Iwashita, T. Nakata, and F. Hirose, "CTL model checking based on forward state traversal," in ICCAD 96: International Conference on Computer Aided Design, IEEE Computer Society Press, 1996, pp. 82-87.
21. D. Kozen, "Results on the propositional μ-calculus," Theoretical Computer Science, Vol. 27, No. 3, pp. 333-354, 1983.
22. O. Kupferman and A. Pnueli, "Once and for all," in Proc. 10th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1995, pp. 25-35.
23. O. Kupferman and M.Y. Vardi, "Freedom, weakness, and determinism: From linear time to branching time," in Proc. 13th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, 1998, pp. 81-92.
24. O. Lichtenstein, A. Pnueli, and L.D. Zuck, "The glory of the past," in Logics of Programs, Lecture Notes in Computer Science 193, Springer-Verlag, 1985, pp. 196-218.
25. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer-Verlag, 1992.
26. K.L. McMillan, Symbolic Model Checking: An Approach to the State-Explosion Problem, Kluwer Academic Publishers, 1993.
27. D. Peled, "Combining partial order reductions with on-the-fly model checking," in CAV 94: Computer Aided Verification, Lecture Notes in Computer Science 818, Springer-Verlag, 1994.
28. J. Queille and J. Sifakis, "Specification and verification of concurrent systems in CESAR," in Fifth International Symposium on Programming, Lecture Notes in Computer Science 137, Springer-Verlag, 1981, pp. 337-351.
29. M.Y. Vardi, "Reasoning about the past with two-way automata," in ICALP 98: International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 1443, Springer-Verlag, 1998, pp. 628-641.
30. M.Y. Vardi and P. Wolper, "Reasoning about infinite computations," Information and Computation, Vol. 115, No. 1, pp. 1-37, 1994.