Modular SMT Proofs for Fast Reflexive Checking inside Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Modular SMT Proofs for Fast Reflexive Checking inside Coq

Abstract

We present a new methodology for exchanging unsatisfia- bility proofs between an untrusted SMT solver and a sceptical proof assistant with computation capabilities like Coq. We advocate modular SMT proofs that separate boolean reasoning and theory reasoning; and structure the communication between theories using Nelson-Oppen combination scheme. We present the design and implementation of a Coq reflexive verifier that is modular and allows for fine-tuned theory-specific verifiers. The current verifier is able to verify proofs for quantifier-free formulae mixing linear arithmetic and uninterpreted functions. Our proof generation scheme benefits from the efficiency of state-of-the-art SMT solvers while being independent from a specific SMT solver proof format. Our only requirement for the SMT solver is the ability to extract unsat cores and generate boolean models. In practice, unsat cores are relatively small and their proof is obtained with a modest overhead by our proof-producing prover. We present experiments assessing the feasibility of the approach for benchmarks obtained from the SMT competition.
Fichier principal
Vignette du fichier
CPP11.pdf (482.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00646960 , version 1 (01-12-2011)

Identifiers

  • HAL Id : hal-00646960 , version 1

Cite

Frédéric Besson, Pierre-Emmanuel Cornilleau, David Pichardie. Modular SMT Proofs for Fast Reflexive Checking inside Coq. First International Conference on Certified Programs and Proofs, 2011, Kenting, Taiwan. ⟨hal-00646960⟩
265 View
259 Download

Share

Gmail Facebook X LinkedIn More