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

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

doi:10.4204/EPTCS.262.3

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2539298_2

DetailsSummary

Released

Journal Article

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

MPS-Authors

/persons/resource/persons183227

Blanchette, Jasmin Christian
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

arXiv:1712.01486.pdf
(Preprint), 118KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Barbosa, H., Blanchette, J. C., Cruanes, S., Ouraoui, D. E., & Fontaine, P. (2017). Language and Proofs for Higher-Order SMT (Work in Progress). Electronic Proceedings in Theoretical Computer Science, 262, 15-22. doi:10.4204/EPTCS.262.3.

Cite as: https://hdl.handle.net/21.11116/0000-0000-64DD-7

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 in March 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.