Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants

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

Volumn 3920 LNCS, Issue , 2006, Pages 167-181

  Fontaine, Pascal ^a   Marion, Jean Yves ^a   Merz, Stephan ^a   Nieto, Leonor Prensa ^a   Tiu, Alwen ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FIRST-ORDER LOGIC; INTERACTIVE PROOF ASSISTANTS; PROOF-PRODUCING REASONERS; SMT SOLVERS;

AUTOMATION; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER ARCHITECTURE; COMPUTER HARDWARE DESCRIPTION LANGUAGES; FORMAL LOGIC;

INTERACTIVE COMPUTER SYSTEMS;

EID: 33745791973     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691372_11     Document Type: Conference Paper

References (30)

1. M. Baaz, U. Egly, and A. Leitsch. Normal form transformations. In J. A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 5, pages 273-333. Elsevier Science B.V., 2001.
2. C. Barrett and S. Berezin. CVC Lite: A new implementation of the cooperating validity checker. In CAV, volume 3114 of LNCS, pages 515-518. Springer, Apr. 2004.
3. D. Barsotti, L. Prensa-Nieto, and A. Tiu. Verification of clock synchronization algorithms: Experiments on a combination of deductive tools. In Proc. of the Fifth Workshop on Automated Verification of Critical Systems (AVOCS), ENTCS, 2005. to appear.
4. M. Bezem, D. Hendriks, and H. de Nivelle. Automated proof construction in type theory using resolution. J. Autom. Reasoning, 29(3-4):253-275, 2002.
5. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. van Rossum, S. Schulz, and R. Sebastiani. The MathSAT 3 System. In CADE, volume 3632 of LNCS, pages 315-321, Tallinn, Estonia, 2005. Springer.
6. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Comm. of the ACM, 5(1):394-391, 1962.
7. D. Déharbe and S. Ranise. Light-weight theorem proving for debugging and verifying units of code. In Software Engineering and Formal Methods (SEFM), pages 220-228. IEEE Comp. Soc., Sept. 2003.
8. P. J. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subexpressions problem. Journal of the ACM, 27(4):758-771, 1980.
9. N. Eén and N. Sörensson. An extensible SAT-solver. In E. Giunchiglia and A. Tacchella, editors, SAT, volume 2919 of LNCS, pages 502-518. Springer, 2003.
10. J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: integrated canonizer and solver. In G. Berry, H. Comon, and A. Finkel, editors, CAV, volume 2102 of LNCS, pages 246-249. Springer, 2001.
11. P. Fontaine. Techniques for verification of concurrent systems with invariants. PhD thesis, Institut Montefiore, Université de Liège, Belgium, Sept. 2004.
12. P. Fontaine and E. P. Gribomont. Using BDDs with combinations of theories. In M. Baaz and A. Voronkov, editors, LPAR, volume 2514 of LNCS, pages 190-201. Springer, 2002.
13. J. Hurd. Integrating Gandalf and HOL. In Theorem Proving in Higher-Order Logics (TPHOLs'99), volume 1690 of LNCS, pages 311-322, Nice, France, 1999. Springer.
14. A. Mahboubi. Programming and certifying the CAD algorithm inside the coq system. In T. Coquand, H. Lombardi, and M.-F. Roy, editors, Mathematics, Algorithms, Proofs, volume 05021 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl, Germany, 2005.
15. A. Meier. TRAMP: Transformation of machine-found proofs into ND-proofs at the assertion level. In D. McAllester, editor, CADE, volume 1831 of LNCS, pages 460-464, Pittsburgh, PA, 2000. Springer.
16. J. Meng, C. Quigley, and L. C. Paulson. Automation for interactive proof: First prototype. Information and Computation, to appear.
17. D. G. Mitchell. A SAT solver primer. EATCS Bulletin, 85:112-133, 2005.
18. G. Necula and P. Lee. Efficient representation and validation of logical proofs. In Logics in Computer Science (LICS'98), pages 93-104. IEEE Press, 1998.
19. G. C. Necula. Compiling with Proofs. PhD thesis, Carnegie Mellon University, Oct. 1998. Available as Technical Report CMU-CS-98-154.
20. G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM, 27(2):356-364, 1980.
21. Q. H. Nguyen, C. Kirchner, and H. Kirchner. External rewriting for skeptical proof assistants. J. Autom. Reason., 29(3-4):309-336, 2002.
22. R. Nieuwenhuis and A. Oliveras. Union-find and congruence closure algorithms that produce proofs. In C. Tinelli and S. Ranise, editors, PDPAR, 2004.
23. T. Nipkow, L. Paulson, and M. Wenzel. Isabelle/HOL. A Proof Assistant for Higher-Order Logic. Number 2283 in LNCS. Springer, 2002.
24. S. Ranise and C. Tinelli. The SMT-LIB standard: Version 1.1, Mar. 2005.
25. J. H. Siekmann and many others. Proof development with OMEGA, In CADE, pages 144-149, 2002.
26. A. Tiu. Formalization of a generalized protocol for clock synchronization in Isabelle/HOL. Archive of Formal Proofs: http://afp.sourceforge.net, 2005.
27. G. S. Tseitin. On the complexity of derivation in prepositional calculus. In A. O. Slisenko, editor, Studies in Constructive Mathematics and Mathematical Logic, volume 11, pages 115-125, 1970.
28. T. Weber. Using a SAT solver as a fast decision procedure for propositional logic in an LCF-style theorem proven In J. Hurd, E. Smith, and A. Darbari, editors, Theorem Proving in Higher Order Logics (TPHOLs 2005), Emerging Trends, pages 180-189. Oxford Univ. Comp. Lab., Prog. Res. Group, 2005. Report PRG-RR-05-02.
29. L. Zhang and S. Malik. The quest for efficient Boolean satisfiability solvers. In A. Voronkov, editor, CADE, volume 2392 of LNCS, pages 295-313. Springer, 2002.
30. L. Zhang and S. Malik. Validating SAT solvers using an independent resolution-based checker. In Design, Automation and Test in Europe (DATE 2003), pages 10880-85, Munich, Germany, 2003. IEEE Comp. Soc.