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

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

doi:10.4204/EPTCS.210.5

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 journal › Conference article › peer-review

7 Scopus citations

Abstract

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 language	English
Pages (from-to)	21-29
Number of pages	9
Journal	Electronic Proceedings in Theoretical Computer Science, EPTCS
Volume	210
DOIs	https://doi.org/10.4204/EPTCS.210.5
State	Published - 17 Jun 2016
Externally published	Yes
Event	1st 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.

Access to Document

10.4204/EPTCS.210.5

Cite this

@article{256d61840f53443fbe6c053426ce10b9,

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

abstract = "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.",

author = "Burak Ekici and Guy Katz and Chantal Keller and Alain Mebsout and Reynolds, {Andrew J.} and Cesare Tinelli",

note = "Publisher Copyright: {\textcopyright} 2016, Open Publishing Association. All rights reserved.; 1st International Workshop on Hammers for Type Theories, HaTT 2016 ; Conference date: 01-07-2016",

year = "2016",

month = jun,

day = "17",

doi = "10.4204/EPTCS.210.5",

language = "אנגלית",

volume = "210",

pages = "21--29",

journal = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

issn = "2075-2180",

publisher = "Open Publishing Association",

}

TY - JOUR

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

AU - Ekici, Burak

AU - Katz, Guy

AU - Keller, Chantal

AU - Mebsout, Alain

AU - Reynolds, Andrew J.

AU - Tinelli, Cesare

PY - 2016/6/17

Y1 - 2016/6/17

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84991672374&partnerID=8YFLogxK

U2 - 10.4204/EPTCS.210.5

DO - 10.4204/EPTCS.210.5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:84991672374

SN - 2075-2180

VL - 210

SP - 21

EP - 29

JO - Electronic Proceedings in Theoretical Computer Science, EPTCS

JF - Electronic Proceedings in Theoretical Computer Science, EPTCS

T2 - 1st International Workshop on Hammers for Type Theories, HaTT 2016

Y2 - 1 July 2016

ER -

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

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this