Extending SMTCoq, a certified checker for SMT (extended abstract)

Burak Ekici, Guy Katz, Chantal Keller, Alain Mebsout, Andrew J. Reynolds, Cesare Tinelli

Research output: Contribution to journalConference articlepeer-review

7 Scopus citations


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.

Original languageAmerican English
Pages (from-to)21-29
Number of pages9
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
StatePublished - 17 Jun 2016
Externally publishedYes
Event1st International Workshop on Hammers for Type Theories, HaTT 2016 - Coimbra, Portugal
Duration: 1 Jul 2016 → …

Bibliographical note

Publisher Copyright:
© 2016, Open Publishing Association. All rights reserved.


Dive into the research topics of 'Extending SMTCoq, a certified checker for SMT (extended abstract)'. Together they form a unique fingerprint.

Cite this