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 :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-01590922
Contributor : Pascal Fontaine <>
Submitted on : Wednesday, September 20, 2017 - 2:27:32 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM

File

Barbosa2.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Haniel Barbosa, Jasmin Blanchette, Pascal Fontaine. Scalable Fine-Grained Proofs for Formula Processing. Proc. Conference on Automated Deduction (CADE), 2017, Gotenburg, Sweden. pp.398 - 412, ⟨10.1007/978-3-642-02959-2_10⟩. ⟨hal-01590922⟩

Share

Metrics

Record views

184

Files downloads

102