Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants (2006)
| Venue: | In Tools and Algorithms for Construction and Analysis of Systems (TACAS |
| Citations: | 20 - 3 self |
BibTeX
@INPROCEEDINGS{Fontaine06expressiveness+,
author = {Pascal Fontaine and Jean-yves Marion and Stephan Merz and Leonor Prensa Nieto and Alwen Tiu and Loria Inria and Lorraine Université Nancy},
title = {Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants},
booktitle = {In Tools and Algorithms for Construction and Analysis of Systems (TACAS},
year = {2006},
pages = {167--181},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Formal system development needs expressive specification languages, but also calls for highly automated tools. These two goals are not easy to reconcile, especially if one also aims at high assurances for correctness. In this paper, we describe a combination of Isabelle/HOL with a proof-producing SMT (Satisfiability Modulo Theories) solver that contains a SAT engine and a decision procedure for quantifier-free first-order logic with equality. As a result, a user benefits from the expressiveness of Isabelle/HOL when modeling a system, but obtains much better automation for those fragments of the proofs that fall within the scope of the (automatic) SMT solver. Soundness is not compromised because all proofs are submitted to the trusted kernel of Isabelle for certification. This architecture is straightforward to extend for other interactive proof assistants and proof-producing reasoners. 1
