Language and Proofs for Higher-Order SMT (Work in Progress)

Haniel Barbosa, Jasmin Christian Blanchette, Simon Cruanes, Daniel El Ouraoui, Pascal Fontaine

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)15-22
Number of pages8
JournalElectronic Proceedings in Theoretical Computer Science
Volume262
Issue number262
DOIs
Publication statusPublished - 2017

Cite this