Skip to Main content Skip to Navigation
Conference papers

Certification of SAT Solvers in Coq

Jean-Pierre Jouannaud 1 Pierre-yves Strub 1 Lianyi Zhang 1 
1 FORMES - Formal Methods for Embedded Systems
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : We describe a fully portable, open source certifier for traces of SAT problems produced by zChaff. It can also be easily adapted for MiniSat, PicoSat or BooleForce, and we have done it for PicoSat. Our certifier has been developed with the proof assistant Coq. We give some figures based on the pigeon hole, comparing both PicoSat and zChaff on the one hand, and our certifier with another certifier also developed with Coq.
Document type :
Conference papers
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download
Contributor : Jean-Pierre Jouannaud Connect in order to contact the contributor
Submitted on : Monday, September 13, 2010 - 9:23:09 AM
Last modification on : Friday, February 4, 2022 - 3:08:36 AM
Long-term archiving on: : Tuesday, October 23, 2012 - 3:56:16 PM


Files produced by the author(s)


  • HAL Id : inria-00516906, version 1



Jean-Pierre Jouannaud, Pierre-yves Strub, Lianyi Zhang. Certification of SAT Solvers in Coq. Guangzhou Symposium on Satisfiability in Logic-Based Modeling, Yuping Shen, Institute of Logic and Cognition Sun Yat-sen University, Guangzhou., Sep 2010, Zuhai, China. ⟨inria-00516906⟩



Record views


Files downloads