SyGuS-Comp 2016: Results and analysis

Rajeev Alur; Dana Fisman; Rishabh Singh; Armando Solar-Lezama

doi:10.4204/EPTCS.229.13

SyGuS-Comp 2016: Results and analysis

Rajeev Alur, Dana Fisman, Rishabh Singh, Armando Solar-Lezama

Department of Computer Science

Research output: Contribution to journal › Conference article › peer-review

11 Scopus citations

Abstract

Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an implementation f that meets both a semantic constraint given by a logical formula φ in a background theory T, and a syntactic constraint given by a grammar G, which specifies the allowed set of candidate implementations. Such a synthesis problem can be formally defined in SyGuS-IF, a language that is built on top of SMT-LIB. The Syntax-Guided Synthesis Competition (SyGuS-Comp) is an effort to facilitate, bring together and accelerate research and development of efficient solvers for SyGuS by providing a platform for evaluating different synthesis techniques on a comprehensive set of benchmarks. In this year's competition we added a new track devoted to programming by examples. This track consisted of two categories, one using the theory of bit-vectors and one using the theory of strings. This paper presents and analyses the results of SyGuS-Comp'16.

Original language	English
Pages (from-to)	178-202
Number of pages	25
Journal	Electronic Proceedings in Theoretical Computer Science, EPTCS
Volume	229
DOIs	https://doi.org/10.4204/EPTCS.229.13
State	Published - 22 Nov 2016
Event	5th Workshop on Synthesis, SYNT 2016 - Toronto, Canada Duration: 17 Jul 2016 → 18 Jul 2016

ASJC Scopus subject areas

Software

Access to Document

10.4204/EPTCS.229.13

Cite this

@article{d1c976212dbf43ccb4480ffd21a2053f,

title = "SyGuS-Comp 2016: Results and analysis",

abstract = "Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an implementation f that meets both a semantic constraint given by a logical formula φ in a background theory T, and a syntactic constraint given by a grammar G, which specifies the allowed set of candidate implementations. Such a synthesis problem can be formally defined in SyGuS-IF, a language that is built on top of SMT-LIB. The Syntax-Guided Synthesis Competition (SyGuS-Comp) is an effort to facilitate, bring together and accelerate research and development of efficient solvers for SyGuS by providing a platform for evaluating different synthesis techniques on a comprehensive set of benchmarks. In this year's competition we added a new track devoted to programming by examples. This track consisted of two categories, one using the theory of bit-vectors and one using the theory of strings. This paper presents and analyses the results of SyGuS-Comp'16.",

author = "Rajeev Alur and Dana Fisman and Rishabh Singh and Armando Solar-Lezama",

note = "Publisher Copyright: {\textcopyright} R. Alur, D. Fisman, R. Singh & A. Solar-Lezama.; 5th Workshop on Synthesis, SYNT 2016 ; Conference date: 17-07-2016 Through 18-07-2016",

year = "2016",

month = nov,

day = "22",

doi = "10.4204/EPTCS.229.13",

language = "English",

volume = "229",

pages = "178--202",

journal = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

issn = "2075-2180",

publisher = "Open Publishing Association",

}

TY - JOUR

T1 - SyGuS-Comp 2016

T2 - 5th Workshop on Synthesis, SYNT 2016

AU - Alur, Rajeev

AU - Fisman, Dana

AU - Singh, Rishabh

AU - Solar-Lezama, Armando

PY - 2016/11/22

Y1 - 2016/11/22

N2 - Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an implementation f that meets both a semantic constraint given by a logical formula φ in a background theory T, and a syntactic constraint given by a grammar G, which specifies the allowed set of candidate implementations. Such a synthesis problem can be formally defined in SyGuS-IF, a language that is built on top of SMT-LIB. The Syntax-Guided Synthesis Competition (SyGuS-Comp) is an effort to facilitate, bring together and accelerate research and development of efficient solvers for SyGuS by providing a platform for evaluating different synthesis techniques on a comprehensive set of benchmarks. In this year's competition we added a new track devoted to programming by examples. This track consisted of two categories, one using the theory of bit-vectors and one using the theory of strings. This paper presents and analyses the results of SyGuS-Comp'16.

AB - Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an implementation f that meets both a semantic constraint given by a logical formula φ in a background theory T, and a syntactic constraint given by a grammar G, which specifies the allowed set of candidate implementations. Such a synthesis problem can be formally defined in SyGuS-IF, a language that is built on top of SMT-LIB. The Syntax-Guided Synthesis Competition (SyGuS-Comp) is an effort to facilitate, bring together and accelerate research and development of efficient solvers for SyGuS by providing a platform for evaluating different synthesis techniques on a comprehensive set of benchmarks. In this year's competition we added a new track devoted to programming by examples. This track consisted of two categories, one using the theory of bit-vectors and one using the theory of strings. This paper presents and analyses the results of SyGuS-Comp'16.

UR - http://www.scopus.com/inward/record.url?scp=85018644041&partnerID=8YFLogxK

U2 - 10.4204/EPTCS.229.13

DO - 10.4204/EPTCS.229.13

M3 - Conference article

AN - SCOPUS:85018644041

SN - 2075-2180

VL - 229

SP - 178

EP - 202

JO - Electronic Proceedings in Theoretical Computer Science, EPTCS

JF - Electronic Proceedings in Theoretical Computer Science, EPTCS

Y2 - 17 July 2016 through 18 July 2016

ER -

SyGuS-Comp 2016: Results and analysis

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this