Programming a symbolic model checker in a fully expansive theorem prover

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

Volumn 2758, Issue , 2003, Pages 171-187

  Amjad, Hasan ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; FORMAL LOGIC; MODEL CHECKING;

BINARY DECISION DIAGRAMS (BDD); PERFORMANCE PENALTIES; SYMBOLIC MODEL CHECKERS; SYMBOLIC MODEL CHECKING; THEOREM PROVERS;

THEOREM PROVING;

EID: 35248843660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10930755_11     Document Type: Article

References (39)

1. M. D. Aagaard, R. B. Jones, and C-J. H. Seger. Combining theorem proving and trajectory evaluation in an industrial environment. In Design Automation Conference (DAC), pages 538-541. ACM/IEEE, 1998.
2. S. Agerholm and H. Skjodt. Automating a model checker for recursive modal assertions in HOL. Technical Report 92, Aarhus University, January 1990.
3. R. E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
4. The BuDDy ROBDD Package. http://www.itu.dk/research/buddy, 2002.
5. J. R. Burch, E. M. Clarke, and D. E. Long. Representing circuits more efficiently in symbolic model checking. In Proceedings of the ACM Design Automation Conference, 1991.
6. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5(2):56-68, June 1940.
7. E. Clarke, A. Gupta, J. Kukula, and O. Strichman. SAT based abstraction-refinement using ILP and machine learning techniques. In Proc. of Conference on Computer-Aided Verification (CAV'02), LNCS, 2002.
8. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, 1999.
9. Edmund M. Clarke, Orna Grumberg, and David E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, September 1994.
10. R. Cleaveland. Tableau-based model checking in the propostional mu-calculus. Extended Abstract, 1988. Computer Science Department, University of Sussex.
11. Satyaki Das and David L. Dill. Counter-example based predicate discovery in predicate abstraction. In Formal Methods in Computer-Aided Design, November 2002.
12. J. Dingel and T. Filkorn. Model checking for infinite state systems using data abtraction, assumption-commitment style reasoning and theorem proving. In Proceedings of the 1995 Workshop on Computer Aided Verification, volume 939 of LNCS, pages 54-69. Springer, 1995.
13. E. A. Emerson and C-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In 1st Annual Symposium on Logic in Computer Science, pages 267-278. IEEE Computer Society Press, 1986.
14. M. P. Fiore, G. D. Plotkin, and D. Turi. Abstract syntax and variable binding. In Proceedings of the 14th Logic in Computer Science Conference, pages 193-202. IEEE, Computer Society Press, 1999.
15. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 2001. Special issue in honour of Rod Burstall.
16. A. D. Gordon and T. Melham. Five axioms of alpha-conversion. In Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics, volume 1125 of LNCS. Springer, 1996.
17. M. J. C. Gordon. Programming combinations of deduction and bdd-based symbolic calculation. LMS Journal of Computation and Mathematics, August 2002.
18. M. J. C. Gordon and T. F. Melham. Introduction to HOL (A theorem-proving environment for higher order logic). Cambridge University Press, 1993.
19. S. Graf and H. Saidi. Construction of abstract state graphs with pvs. In Proceedings of Computer Aided Verification (CAV '97), volume 1254 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
20. The HOL Proof Tool. http://hol.sf.net, 2003.
21. G. J. Holzmann and D. Peled. The state of spin. In CAV'96: 8th International Conference on Computer Aided Verification, volume 1102 of LNCS, pages 385-389. Springer, 1996.
22. SRI International. Prototype verification system. http://pvs.csl.sri.com.
23. J. Joyce and C. Seger. The HOL-Voss system : Model checking inside a general-purpose theorem prover. In Higher Order Logic Theorem Proving and its Applications, volume 780 of LNCS, pages 185-198. Springer, 1993.
24. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, 1983.
25. R. P. Kurshan and L. Lamport. Verification of a multiplier: 64 bits and beyond. In C. Courcoubetis, editor, Proceedings of the 5th Workshop on Computer Aided Verification, pages 166-180, June 1993.
26. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
27. Sam Owre, S. Rajan, J. M. Rushby, N. Shankar, and M. K. Srivas. Pvs: Combining specification, proof checking, and model checking. In CAV'96: 8th International Conference on Computer Aided Verification, pages 411-414, 1996.
28. A. Pnueli, S. Rua, and L. Zuck. Automatic deductive verification with invisible invariants. In Proceedings of Tools and Algorithms for the Construction and Analysis of Systems, 2001.
29. S. Rajan, N. Shankar, and M. K. Srivas. An integration of model checking and automated proof checking. In Proceedings of Computer Aided Verification. Springer-Verlag, 1995.
30. H. Saidi. Model checking guided abstraction and analysis. In Proceedings of the 7th International Static Analysis Symposium, 2000.
31. C-J. H. Seger. Voss - a formal hardware verification system: User's guide. Technical report, The University of British Columbia, December 1993. UBC-TR-93-45.
32. T. Skolem. Some remarks on axiomatised set theory. In J. van Heijenoort, editor, From Frege to Godel: A Source Book in Mathematical Logic, 1879-1931, pages 290-301. Harvard University Press, 1967.
33. C. Sprenger. Deductive Local Model Checking. PhD thesis, Computer Networking Laboratory, Swiss Federal Institute of Technology, Lausanne, Switzerland, 2000.
34. Stanford Temporal Prover. http://www-step.stanford.edu.
35. C. Stirling and D. J. Walker. Local model checking in the modal mu-calculus. In Josep Díaz and Fernando Orejas, editors, Proceedings of the Colloquium on Trees in Algebra and Programming (CAAP), number 1 in Lecture Notes in Computer Science. Springer, 1989. CAAP is the predecessor to ETAPS.
36. Symbolic Model Prover. http://www.cs.cmu.edu/∼modelcheck/symp.html.
37. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309, 1955.
38. T. E. Uribe. Combinations of model checking and theorem proving. In Proceedings of the Third Intl. Workshop on Frontiers of Combining Systems, volume 1794 of LNCS, pages 151-170. Springer-Verlag, March 2000.
39. G. Winskel. A note on model checking in the modal ν-calculus. In Giorgio Ausiello, Mariangiola Dezani-Ciancaglini, and Simona Ronchi Della Rocca, editors, Proceedings of the International Colloquium on Automata, Languages and Programming, volume 372 of Lecture Notes in Computer Science. Springer, 1989.