Certifying model checkers

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

Volumn 2102, Issue , 2001, Pages 2-13

  Namjoshi, Kedar S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMS; CALCULATIONS; COMPUTATION THEORY; COMPUTER AIDED ANALYSIS; TEMPORAL LOGIC;

ALGORITHMIC TECHNIQUES; AUTOMATED THEOREM PROVING; BRANCHING TIME; LINEAR-TIME PROPERTIES; MODEL CHECKER; PROOF SYSTEM; TEMPORAL PROPERTY; TIGHT INTEGRATIONS;

MODEL CHECKING;

EID: 84958739943     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_2     Document Type: Conference Paper

References (33)

1. T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In CAV, 2001.
2. N. Bjorner, A. Browne, M. Colon, B. Finkbeiner, Z. Manna, H. Sipma, and T Uribe. Verifying temporal properties of reactive systems: A STeP tutorial. Formal Methods in System Design, 2000.
3. Bradfield and C. Stirling. Local model checking for infinite state spaces. TCS, 96, 1992.
4. E.M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop on Logics of Programs, volume 131 of LNCS, 1981.
5. K.M Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
6. S.A. Cook. Soundness and completeness of an axiom system for program verification. SIAM J. Comput, 1978.
7. E.A. Emerson and C.S. Jutla. Tree automata, mu-calculus and determinacy (extended abstract). In FOCS, 1991.
8. E. Allen Emerson, C.S. Jutla, and A.P. Sistla. On model-checking for fragments of μ-calculus. In CAV, 1993.
9. E.A and C-L Lei. Efficient model checking in fragments of the propositional mu-calculus (extended abstract). In LICS, 1986.
10. E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science: Volume B, Formal Models and Semantics. North-Holland Pub. Co./MIT Press, 1990.
11. L. Fix and O. Grumberg. Verification of temporal properties. Journal of Logic and Computation, 1996.
12. R. Floyd. Assigning meaning to programs. In Mathematical Aspects of Computer Science XIX. American Mathemetical Society, 1967.
13. R.H. Hardin, Z. Har’el, and R.P. Kurshan. COSPAN. In CAV, volume 1102 of LNCS, 1996.
14. C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 1969.
15. J.J. Joyce and C-J.H. Seger. The HOL-Voss system: Model-checking inside a general-purpose theorem-prover. In HUG, volume 780 of LNCS, 1993.
16. D. Janin and I. Walukiewicz. Automata for the modal mu-calulus and related results. In MFCS, 1995.
17. R.M. Keller. Formal verification of parallel programs. CACM, 1976. Kic. A. Kick. Generation of witnesses for global mu-calculus model checking. available at http://liinwww.ira.uka.de/~kick.
18. D. Kozen. Results on the propositional mu-calculus. In ICALP, 1982.
19. K.L. McMillan. Verification of infinite state systems by compositional model checking. In CHARME, 1999.
20. P. Manolios, K.S. Namjoshi, and R. Summers. Linking theorem proving and model-checking with well-founded bisimulation. In CAV, 1999.
21. Z. Manna and A. Pnueli. How to cook a temporal proof system for your pet language. In POPL, 1983.
22. Z. Manna and A. Pnueli. Specification and verification of concurrent programs by V-automata. In POPL, 1987.
23. G.C. Necula and P. Lee. Safe kernel extensions without run-time checking. In OSDI, 1996.
24. G.C. Necula and P. Lee. The design and implementation of a certifying compiler. In PLDI, 1998.
25. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In TACAS, volume 2031 of LNCS, 2001.
26. D. Peled and L. Zuck. From model checking to a temporal proof. In The 8th International SPIN Workshop on Model Checking of Software,volume 2057 of LNCS, 2001.
27. J-P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. of the 5th International Symposium on Programming, volume 137 of LNCS, 1982.
28. S. Rajan, N. Shankar, and M.K. Srivas. An integration of model checking with automated proof checking. In CAV, volume 939 of LNCS, 1995.
29. R.S. Streett and E.A. Emerson. The propositional mu-calculus is elementary. In ICALP, 1984. Full version in Information and Computation 81(3): 249264, 1989.
30. C. Sprenger. A verified model checker for the modal μ-calculus in Coq. InTACAS, volume 1384 of LNCS, 1998.
31. P. Stevens and C. Stirling. Practical model-checking using games. In TACAS, 1998.
32. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. In TAPSOFT, 1989. Full version in TCS vol.89, 1991.
33. S. Yu and Z. Luo. Implementing a model checker for LEGO. In FME, volume 1313 of LNCS, 1997.