Scalable Fine-Grained Proofs for Formula Processing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

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

Dates and versions

hal-01590922 , version 1 (20-09-2017)

Identifiers

Cite

Haniel Barbosa, Jasmin Christian 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⟩
134 View
182 Download

Altmetric

Share

Gmail Facebook X LinkedIn More