Shallow lazy proofs

Lecture Notes in Computer Science

Volumn 3603, Issue , 2005, Pages 35-49

  Amjad, Hasan ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY;

DECISION PROCEDURES; PROOF RECONSTRUCTION; WORK-FLOW;

THEOREM PROVING;

EID: 26844446827     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11541868_3     Document Type: Conference Paper

References (19)

1. H. Amjad. Programming a symbolic model checker in a fully expansive theorem prover. In David A. Basin and Burkhart Wolff, editors, Proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics, volume 2758 of Lecture Notes in Computer Science, pages 171-187. Springer-Verlag, 2003.
2. Thomas Ball, Byron Cook, Shuvendu K. Lahiri, and Lintao Zhang. Zapato: Automatic theorem proving for predicate abstraction refinement. In Rajeev Alur and Doron Peled, editors, Computer Aided Verification, 16th International Conference, volume 3114 of LNCS, pages 457-461. Springer, 2004.
3. M. Ben-Ari, Z. Manna, and A. Pnueli. The temporal logic of branching time. Acta Informatica, 20:207-226, 1983.
4. Richard John Boulton. Efficiency in a fully-expansive theorem prover. Technical report. University of Cambridge Computer Laboratory, 1994.
5. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5(2):56-68, June 1940.
6. Leonardo de Moura, Harald Rueß, and Maria Sorea. Lazy theorem proving for bounded model checking over infinite domains. In Proceedings of the 18th International Conference on Automated Deduction, volume 2392 of Lecture Notes in Computer Science, pages 438-455. Springer-Verlag, July 2002.
7. M. J. C. Gordon. HolSatLib documentation, http://www.cl.caa.ac.uk/users/ mjcg/HolSatLib/HolSatLib.ps, 2002.
8. M. J. C. Gordon. Programming combinations of deduction and BDD-based symbolic calculation. LMS Journal of Computation and Mathematics, 5:56-76, August 2002.
9. M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A theorem-proving environment for higher order logic. Cambridge University Press, 1993.
10. M. J. C. Gordon, A. R. G. Milner, and C. P. Wadsworth. Edinburgh LCF: A mechanised logic of computation, volume 78 of LNCS. Springer-Verlag, 1979.
11. J. Harrison. Binary decision diagrams as a HOL derived rule. The Computer Journal, 38(2):162-170, 1995.
12. J. Harrison, 2005. Private communication. See directory hol_light/Examples/holby.ml of the HOL Light distribution [14].
13. The HOL-4 Proof Tool. Tool URL http://hol.sf.net, 2003.
14. The HOL Light Proof Tool. Tool URL http://www.cl.cam.ac.uk/users/jrh/hol- light/index.html, 2005.
15. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, 1983.
16. A. R. G. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, 1978.
17. A. R. G. Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML - Revised. MIT Press, May 1997.
18. George C. Necula and Peter Lee. Proof generation in the Touchstone theorem prover. In David A. McAllester, editor, Conference on Automated Deduction (CADE), volume 1831 of Lecture Notes in Computer Science, pages 25-44. Springer, 2000.
19. Peter Sestoft. Moscow ML. http://www.dina.dk/~sestoft/mosml.html, 2003.