A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses

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

Abstract

We present a way to enjoy the power of SAT and SMT provers in Coq without compromising soundness. This requires these provers to return not only a yes/no answer, but also a proof witness that can be independently rechecked. We present such a checker, written and fully certified in Coq. It is conceived in a modular way, in order to tame the proofs' complexity and to be extendable. It can currently check witnesses from the SAT solver ZChaff and from the SMT solver veriT. Experiments highlight the efficiency of this checker. On top of it, new reflexive Coq tactics have been built that can decide a subset of Coq's logic by calling external provers and carefully checking their answers.
Fichier principal
Vignette du fichier
cpp11.pdf (431.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00639130 , version 1 (20-03-2012)

Identifiers

Cite

Michaël Armand, Germain Faure, Benjamin Grégoire, Chantal Keller, Laurent Thery, et al.. A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses. CPP - Certified Programs and Proofs - First International Conference - 2011, Dec 2011, Kenting, Taiwan. pp.135-150, ⟨10.1007/978-3-642-25379-9_12⟩. ⟨hal-00639130⟩
524 View
1074 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More