Extending SMTCoq, a Certified Checker for SMT (Extended Abstract)

Burak Ekici
(The University of Iowa)
Guy Katz
(New York University)
Chantal Keller
(LRI, Univ. Paris-Sud)
Alain Mebsout
(The University of Iowa)
Andrew J. Reynolds
(The University of Iowa)
Cesare Tinelli
(The University of Iowa)

This extended abstract reports on current progress of SMTCoq, a communication tool between the Coq proof assistant and external SAT and SMT solvers. Based on a checker for generic first-order certificates implemented and proved correct in Coq, SMTCoq offers facilities both to check external SAT and SMT answers and to improve Coq's automation using such solvers, in a safe way. Currently supporting the SAT solver zChaff, and the SMT solver veriT for the combination of the theories of congruence closure and linear integer arithmetic, SMTCoq is meant to be extendable with a reasonable amount of effort: we present work in progress to support the SMT solver CVC4 and the theory of bit vectors.

In Jasmin Christian Blanchette and Cezary Kaliszyk: Proceedings First International Workshop on Hammers for Type Theories (HaTT 2016), Coimbra, Portugal, July 1, 2016, Electronic Proceedings in Theoretical Computer Science 210, pp. 21–29.
Published: 17th June 2016.

ArXived at: http://dx.doi.org/10.4204/EPTCS.210.5 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org