English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Language and Proofs for Higher-Order SMT (Work in Progress)

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.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/21.11116/0000-0000-64DD-7 Version Permalink: http://hdl.handle.net/21.11116/0000-0002-95D2-8
Genre: Journal Article

Files

show Files
hide Files
:
arXiv:1712.01486.pdf (Preprint), 118KB
Name:
arXiv:1712.01486.pdf
Description:
File downloaded from arXiv at 2018-02-06 14:39 In Proceedings PxTP 2017, arXiv:1712.00898
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show

Creators

show
hide
 Creators:
Barbosa, Haniel1, Author
Blanchette, Jasmin Christian2, Author              
Cruanes, Simon1, Author
El Ouraoui, Daniel1, Author
Fontaine, Pascal1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545              

Content

show
hide
Free keywords: Computer Science, Logic in Computer Science, cs.LO
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2017-12-052017
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Method: -
 Identifiers: arXiv: 1712.01486
DOI: 10.4204/EPTCS.262.3
URI: http://arxiv.org/abs/1712.01486
BibTex Citekey: Barbosa1712.01486
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Electronic Proceedings in Theoretical Computer Science
  Abbreviation : EPTCS
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 262 Sequence Number: - Start / End Page: 15 - 22 Identifier: -