Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
  Lokale TagsFreigabegeschichteDetailsÜbersicht

Freigegeben
Zeitschriftenartikel

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

MPG-Autoren
/persons/resource/persons183227

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

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (beschränkter Zugriff)
Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.
Volltexte (frei zugänglich)

arXiv:1712.01486.pdf
(Preprint), 118KB

Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Barbosa, H., Blanchette, J. C., Cruanes, S., El Ouraoui, D., & 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.


Zitierlink: https://hdl.handle.net/21.11116/0000-0000-64DD-7
Zusammenfassung
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.