Scalable Fine-Grained Proofs for Formula Processing - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2017

Scalable Fine-Grained Proofs for Formula Processing

(1, 2, 3) , (2, 4) , (2, 3)
1
2
3
4

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
rep.pdf (233.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01526841 , version 1 (23-05-2017)

Identifiers

  • HAL Id : hal-01526841 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More