Nothing Special   »   [go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:1712.01486v1 (cs)
[Submitted on 5 Dec 2017]

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

Authors:Haniel Barbosa (University of Lorraine, CNRS, Inria, and LORIA), Jasmin Christian Blanchette (University of Lorraine, CNRS, Inria, and LORIA, Vrije Universiteit Amsterdam, Max-Planck-Institut für Informatik), Simon Cruanes (University of Lorraine, CNRS, Inria, and LORIA), Daniel El Ouraoui (University of Lorraine, CNRS, Inria, and LORIA), Pascal Fontaine (University of Lorraine, CNRS, Inria, and LORIA)
View PDF
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.
Comments: In Proceedings PxTP 2017, arXiv:1712.00898
Subjects: Logic in Computer Science (cs.LO)
Cite as: arXiv:1712.01486 [cs.LO]
  (or arXiv:1712.01486v1 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.1712.01486
Journal reference: EPTCS 262, 2017, pp. 15-22
Related DOI: https://doi.org/10.4204/EPTCS.262.3

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Tue, 5 Dec 2017 05:47:28 UTC (19 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2017-12
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)