@inproceedings{cc6a9dd9948545fbb1d63e8e0a0207e4,
title = "Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants",
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 quanti fier-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.",
author = "Pascal Fontaine and Marion, \{Jean Yves\} and Stephan Merz and Nieto, \{Leonor Prensa\} and Alwen Tiu",
year = "2006",
doi = "10.1007/11691372\_11",
language = "English",
isbn = "3540330569",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "167--181",
booktitle = "Tools and Algorithms for the Construction and Analysis of Systems - 12th International Conference, TACAS 2006. Held as Part of the Joint European Conf. on Theory and Practice of Software, ETAPS 2006",
note = "12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2006. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006 ; Conference date: 25-03-2006 Through 02-04-2006",
}