Better SMT Proofs for Easier Reconstruction

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 metadatas

Cited literature [11 references]  Display  Hide  Download
Contributor : Hans-Jörg Schurr <>
Submitted on : Tuesday, November 26, 2019 - 6:29:05 PM
Last modification on : Thursday, November 28, 2019 - 1:38:58 AM


Files produced by the author(s)


  • HAL Id : hal-02381819, version 1



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



Record views


Files downloads