Skip to Main content Skip to Navigation
Conference papers

Reconstructing veriT Proofs in Isabelle/HOL

Mathias Fleury 1 Hans-Jörg Schurr 2, 3
2 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
3 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
Abstract : Automated theorem provers are now commonly used within interactive theorem provers to discharge an increasingly large number of proof obligations. To maintain the trustworthiness of a proof, the automatically found proof must be verified inside the proof assistant. We present here a reconstruction procedure in the proof assistant Isabelle/HOL for proofs generated by the satisfiability modulo theories solver veriT which is part of the smt tactic. We describe in detail the architecture of our improved reconstruction method and the challenges we faced in designing it. Our experiments show that the veriT-powered smt tactic is regularly suggested by Sledgehammer as the fastest method to automatically solve proof goals.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
Contributor : Hans-Jörg Schurr <>
Submitted on : Monday, September 2, 2019 - 5:03:32 PM
Last modification on : Friday, December 11, 2020 - 6:09:21 PM
Long-term archiving on: : Friday, January 10, 2020 - 9:18:12 PM


Files produced by the author(s)



Mathias Fleury, Hans-Jörg Schurr. Reconstructing veriT Proofs in Isabelle/HOL. PxTP 2019 - Sixth Workshop on Proof eXchange for Theorem Proving, Aug 2019, Natal, Brazil. pp.36-50, ⟨10.4204/EPTCS.301.6⟩. ⟨hal-02276530⟩



Record views


Files downloads