Better SMT Proofs for Easier Reconstruction - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

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.
Fichier principal
Vignette du fichier
aitp.pdf (214.3 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02381819 , version 1 (26-11-2019)

Identifiers

  • HAL Id : hal-02381819 , version 1

Cite

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⟩
121 View
61 Download

Share

Gmail Mastodon Facebook X LinkedIn More