Bounded model generation for isabelle/HOL

Electronic Notes in Theoretical Computer Science

Volumn 125, Issue 3, 2005, Pages 103-116

  Weber, Tjark ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Finite Model Generation; Higher Order Logic; Interactive Theorem Proving

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS; SET THEORY; THEOREM PROVING;

FINITE MODEL GENERATION; HIGHER-ORDER LOGICS; HOL FORMULA; INTERACTIVE THEOREM PROVING;

PROBABILISTIC LOGICS;

EID: 21644487933     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.10.027     Document Type: Conference Paper

References (21)

1. Peter B. Andrews An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof second edition Applied Logic Series volume 27 July 2002 Kluwer Academic Publishers
2. Stefan Berghofer, and Markus Wenzel Inductive datatypes in HOL - lessons learned in formal-logic engineering Theorem Proving in Higher Order Logics, 12th International Conference TPHOLs'99 Lecture Notes in Computer Science volume 1690 1999 Springer 19 36
3. Alonzo Church A formulation of the simple theory of types Journal of Symbolic Logic 5 1940 56 68
4. Koen Claessen and Niklas Sörensson. New techniques that improve MACE-style finite model finding. In CADE-19, Workshop W4, Model Computation - Principles, Algorithms, Applications, 2003
5. M. Davis, G. Logemann, and D. Loveland A machine program for theorem proving Communications of the ACM 5 1962 394 397
6. DIMACS satisfiability suggested format Available from ftp://dimacs.rutgers.edu/pub/challenge/satisfiability/doc 1993
7. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT solver. In Design Automation and Test in Europe (DATE), pages 142-149, 2002
8. M.J.C. Gordon T.F. Melham Introduction to HOL: a theorem proving environment for higher order logic 1993 Cambridge University Press
9. M.J.C. Gordon, and A.M. Pitts The HOL logic and system J. Bowen Towards Verified Systems Real-Time Safety Critical Systems Series volume 2 1994 Elsevier 49 70
10. Daniel Jackson. Automating first-order relational logic. In Proc. ACM SIGSOFT Conf. Foundations of Software Engineering, pages 130-139, San Diego, November 2000
11. Paul Jackson and Daniel Sheridan. The optimality of a fast CNF conversion and its use with SAT. Technical Report APES-82-2004, APES Research Group, March 2004
12. Jia Meng, and Lawrence C. Paulson Experiments on supporting interactive proof using resolution David Basin Michael Rusinowitch Automated Reasoning - Second International Joint Conference IJCAR 2004 Lecture Notes in Artificial Intelligence volume 3097 2004 Springer 372 384
13. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen The Definition of Standard ML - Revised May 1997 MIT Press
14. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. of the 38th Design Automation Conference, Las Vegas, June 2001
15. Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel Isabelle/HOL - A Proof Assistant for Higher-Order Logic Lecture Notes in Computer Science volume 2283 2002 Springer
16. Lawrence C. Paulson The inductive approach to verifying cryptographic protocols Journal of Computer Security 6 1998 85 128
17. Graham Steel, Alan Bundy, and Ewen Denney Finding counterexamples to inductive conjectures and discovering security protocol attacks AISB Journal 1 2 2002
18. Tanel Tammet. Finite model building: improvements and comparisons. In CADE-19, Workshop W4, Model Computation - Principles, Algorithms, Applications, 2003
19. G. Tseitin. On the complexity of derivation in propositional calculus. In A. Slisenko, editor, Studies in Constructive Mathematics and Mathematical Logic, Part 2, pages 115-125, 1970
20. Markus Wenzel Type classes and overloading in higher-order logic Elsa L. Gunter Amy P. Felty Theorem Proving in Higher Order Logics, 10th International Conference TPHOLs'97 Lecture Notes in Computer Science volume 1275 1997 Springer 307 322
21. L. Zhang, and S. Malik The quest for efficient boolean satisfiability solvers Andrei Voronkov Proceedings of the 8th International Conference on Computer Aided Deduction (CADE 2002) Lecture Notes in Computer Science volume 2392 2002 Springer