Scalable Fine-Grained Proofs for Formula Processing

Abstract : We present a framework for processing formulas in automatic theorem provers, with generation of detailed proofs. The main components are a generic contextual recursion algorithm and an extensible set of inference rules. Clausification, skolemization, theory-specific simplifications, and expansion of 'let' expressions are instances of this framework. With suitable data structures, proof generation adds only a linear-time overhead, and proofs can be checked in linear time. We implemented the approach in the SMT solver veriT. This allowed us to dramatically simplify the code base while increasing the number of problems for which detailed proofs can be produced, which is important for independent checking and reconstruction in proof assistants.
Document type :
Reports
Complete list of metadatas

Cited literature [40 references]  Display  Hide  Download

https://hal.inria.fr/hal-01526841
Contributor : Haniel Barbosa <>
Submitted on : Tuesday, May 23, 2017 - 3:42:40 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM
Long-term archiving on : Monday, August 28, 2017 - 5:51:13 PM

File

rep.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01526841, version 1

Collections

Citation

Haniel Barbosa, Jasmin Blanchette, Pascal Fontaine. Scalable Fine-Grained Proofs for Formula Processing. [Research Report] Universite de Lorraine, CNRS, Inria, LORIA, Nancy, France; Universidade Federal do Rio Grande do Norte, Natal, Brazil; Vrije Universiteit Amsterdam, Amsterdam, The Netherlands; Max-Planck-Institut für Informatik, Saarbrücken, Germany. 2017, pp.25. ⟨hal-01526841⟩

Share

Metrics

Record views

305

Files downloads

141