SyGuS Techniques in the Core of an SMT Solver

Andrew Reynolds; Cesare Tinelli

doi:10.4204/EPTCS.260.8

Back

SyGuS Techniques in the Core of an SMT Solver

Journal article

Open access

SyGuS Techniques in the Core of an SMT Solver

Andrew Reynolds and Cesare Tinelli

Electronic proceedings in theoretical computer science, Vol.260(Proc. SYNT 2017), pp.81-96

11/28/2017

DOI: 10.4204/EPTCS.260.8

Files and links (1)

url

https://doi.org/10.4204/EPTCS.260.8View

Published (Version of record) Open Access

Abstract

EPTCS 260, 2017, pp. 81-96 We give an overview of recent techniques for implementing syntax-guided synthesis (SyGuS) algorithms in the core of Satisfiability Modulo Theories (SMT) solvers. We define several classes of synthesis conjectures and corresponding techniques that can be used when dealing with each class of conjecture.

Computer Science - Logic in Computer Science

Details

Title: Subtitle: SyGuS Techniques in the Core of an SMT Solver
Creators: Andrew Reynolds - University of Iowa
Cesare Tinelli - University of Iowa
Resource Type: Journal article
Publication Details: Electronic proceedings in theoretical computer science, Vol.260(Proc. SYNT 2017), pp.81-96
DOI: 10.4204/EPTCS.260.8
ISSN: 2075-2180
eISSN: 2075-2180
Language: English
Date published: 11/28/2017
Academic Unit: Computer Science
Record Identifier: 9984002455502771

Metrics

35 Record Views

10 Times Cited - Web of Science