Verifying SAT and SMT in Coq for a fully automated decision procedure - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Verifying SAT and SMT in Coq for a fully automated decision procedure

Résumé

Enjoying the power of SAT and SMT solvers in the Coq proof as- sistant without compromising soundness requires more than a yes/no answer from them. SAT and SMT solvers should also return a proof witness that can be checked by an external tool. We propose a fully certified checker for such witnesses written in Coq. It can currently check witnesses from the SAT solvers ZChaff and MiniSat 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
ArmandAl.pdf (218.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00614041 , version 1 (08-08-2011)

Identifiants

  • HAL Id : inria-00614041 , version 1

Citer

Mickaël Armand, Germain Faure, Benjamin Grégoire, Chantal Keller, Laurent Théry, et al.. Verifying SAT and SMT in Coq for a fully automated decision procedure. PSATTT'11: International Workshop on Proof-Search in Axiomatic Theories and Type Theories, Germain Faure, Stéphane Lengrand, Assia Mahboubi, Aug 2011, Wroclaw, Poland. ⟨inria-00614041⟩
309 Consultations
914 Téléchargements

Partager

Gmail Facebook X LinkedIn More