TY - JOUR
T1 - Language and Proofs for Higher-Order SMT (Work in Progress)
AU - Barbosa, Haniel
AU - Blanchette, Jasmin Christian
AU - Cruanes, Simon
AU - El Ouraoui, Daniel
AU - Fontaine, Pascal
PY - 2017
Y1 - 2017
N2 - Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic modulo theories. Nevertheless, higher-order logic within SMT is still little explored. One main goal of the Matryoshka project, which started inMarch 2017, is to extend the reasoning capabilities of SMT solvers and other automatic provers beyond first-order logic. In this preliminary report, we report on an extension of the SMT-LIB language, the standard input format of SMT solvers, to handle higher-order constructs. We also discuss how to augment the proof format of the SMT solver veriT to accommodate these new constructs and the solving techniques they require.
AB - Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic modulo theories. Nevertheless, higher-order logic within SMT is still little explored. One main goal of the Matryoshka project, which started inMarch 2017, is to extend the reasoning capabilities of SMT solvers and other automatic provers beyond first-order logic. In this preliminary report, we report on an extension of the SMT-LIB language, the standard input format of SMT solvers, to handle higher-order constructs. We also discuss how to augment the proof format of the SMT solver veriT to accommodate these new constructs and the solving techniques they require.
UR - http://www.scopus.com/inward/record.url?scp=85045685151&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85045685151&partnerID=8YFLogxK
U2 - 10.4204/EPTCS.262.3
DO - 10.4204/EPTCS.262.3
M3 - Article
SN - 2075-2180
VL - 262
SP - 15
EP - 22
JO - Electronic Proceedings in Theoretical Computer Science
JF - Electronic Proceedings in Theoretical Computer Science
IS - 262
ER -
