Symbolic model checking with rich assertional languages

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

Volumn 1254, Issue , 1997, Pages 424-435

  Kesten, Y ^a   Maler, O ^b   Marcus, M ^c   Pnueli, A ^c   Shahar, E ^c  

^a INTEL CORPORATION   (Israel)

^b VERIMAG   (France)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER AIDED ANALYSIS;

ASSERTIONAL LANGUAGES; DEDUCTIVE VERIFICATION; FINITE STATE SYSTEMS; INFINITE STATE SYSTEMS; INVARIANT GENERATIONS; PARAMETERIZED DESIGN; SYMBOLIC MODEL CHECKING; TREE ARCHITECTURES;

MODEL CHECKING;

EID: 84947424451     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (33)

1. K. R. Apt and D. Kozen. Limits for automatic program verification of finitestate concurrent systems. Information Processing Letters, 22(6), 1986.
2. N. Bjørner, I.A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. In LNCS 976, 1995.
3. R.V. Book and F. Otto. String-Rewriting Systems, Springer, 1993.
4. A. Bouajjani and O. Maler, Reachabihty Analysis of Push-down Automata. Workshop on Infinite-state Systems, Pisa, 1996.
5. M.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many finite state processes. In PODC'86.
6. J.R. Butch, E.M. Clarke, et al. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142-170, 1992.
7. D.A. Basin and N. Klarlund. Hardware verification using 2nd-order logic. In P. Wolper, editor, CAV'95, LNCS 939, 1995.
8. S. Bensalem, Y. Lakhnech, and H. Saidi. Powerful techniques for the automatic generation of invariants. CAV'96, 1996.
9. R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(12):1035-1044, 1986.
10. E.M. Clarke and E.A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. Logics of Programs, LNCS 131, 1981.
11. E.M. Clarke, et al. Automatic verification of finite state concurrent systems using temporal logic specifications. ACM Trans. Prog. Lang. Sys., 1986.
12. E.M. Clarke, O. Grumberg, et al. Verification of the futurebus+ cache coherence protocol. Proceedings of the Eleventh International Symposium on Computer Hardware Description Languages and their Applications. 1993.
13. E.M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks using abstraction and regular languages. In CONCUR'95, 1995.
14. J. Doner. Tree Acceptors and some of their applications, JCSS 4, 1970.
15. E. A. Emerson, K. S. Namjoshi. Reasoning about rings. POPL'95, 1995.
16. E.A. Emerson and K.S. Namjoshi. Automatic verification of parameterized synchronous systems. In R. Alur and T. Henzinger, editors, CAV'96, 1996.
17. F. Gecseg and M. Steinby. Tree Automata Akademiai Kiado, 1984.
18. N. Halbwachs, F. Lagnier, et al. An experience in proving regular networks of processes by modular model checking. Acta Informatica, 29(6/7), 1992.
19. J.G. Henriksen, J. Jensen, et al. Mona: Monadic second-order logic in practice. In TACAS '95, LNCS 1019, 1996.
20. C.N. Ip and D. Dill. Verifying systems with replicated components in Murk. tn R. Alur and T. Henzinger, editors, CAV'96, 1996.
21. O. Kupferman and O. Grumberg. Branching Time Temporal Logic and Amorphous Tree Automata. Information and Computation 125, 1996.
22. R.P. Kurshan and K. McMillan. A structural induction theorem for processes. In P. Rudnicld, editor, PODC'89, Edmonton, AB, Canada, 1989.
23. D. Lesens, N. Halbwachs, and P. Raymond. Automatic verification of parameterized linear networks of processes. In POPL'97, Paris, 1997.
24. Z. Manna, A. Anuchitanukul, et al. STEP: The Stanford Temporal Prover. Technical Report STAN-CS-TR-94-1518, Stanford University, 1994.
25. K.L McMillan. Symbolic Model Checking. 1993.
26. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
27. A. Pnueli and E. Shahar. A platform for combining deductive with algorithmic verification. In R. Alur and T. ttenzinger, editors, CAV'96, 1996.
28. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in cesar. International Symposium on Programming, LNCS 137, 1982.
29. Z. Shtadler and O. Grumberg. Network grammars, communication behaviors and automatic verification. In LNCS 407, 1989.
30. A.P. Sistla and S.M. German. Reasoning about systems with many processes. J. ACM, 39:675-735, 1992.
31. N. Shankar, S. Owre, and J.M. Rushby. The PVS proof checker: A reference manual (draft). Technical report, SRI International, Menlo Park, CA, 1993.
32. J.W. Thatcher, J.B. Wright. Generalized finite automata with application to a decision procedure in second order logic. Math. Sys. Theory 2, 1968.
33. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In LNCS 407, 1989.