Skip to Main content Skip to Navigation
New interface
Conference papers

Better SMT Proofs for Easier Reconstruction

Haniel Barbosa 1, 2 Jasmin Christian Blanchette 3 Mathias Fleury 3 Pascal Fontaine 2, 1 Hans-Jörg Schurr 1, 2 
1 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
2 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
Abstract : Proof assistants are used in verification, formal mathematics, and other areas to provide trustworthy , machine-checkable formal proofs of theorems. Proof automation reduces the burden of proof on users, thereby allowing them to focus on the core of their arguments. A successful approach to automation is to invoke an external automatic theorem prover, such as a satisfiability-modulo-theories (SMT) solver, reconstructing any generated proofs using the proof assistant's inference kernel. The success rate of reconstruction, and hence the usefulness of this approach, depends on the quality of the generated proofs. We report on the experience gained by working on reconstruction of proofs generated by an SMT solver while also improving the solver's output.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Hans-Jörg Schurr Connect in order to contact the contributor
Submitted on : Tuesday, November 26, 2019 - 6:29:05 PM
Last modification on : Saturday, June 25, 2022 - 7:42:43 PM


Files produced by the author(s)


  • HAL Id : hal-02381819, version 1


Haniel Barbosa, Jasmin Christian Blanchette, Mathias Fleury, Pascal Fontaine, Hans-Jörg Schurr. Better SMT Proofs for Easier Reconstruction. AITP 2019 - 4th Conference on Artificial Intelligence and Theorem Proving, Apr 2019, Obergurgl, Austria. ⟨hal-02381819⟩



Record views


Files downloads