SyGuS-Comp 2016: Results and Analysis
Name
1611.07627.pdf
Description
Published version
Size
1.53 MB
Format
Adobe PDF
Checksum (MD5)
154c434ab69bc851e231d162b9283726
Author(s)
Alur, Rajeev
Fisman, Dana
Singh, Rishabh
Solar-Lezama, Armando
Date Issued
November 22, 2016
Publisher
Open Publishing Association
Citation
Alur, Rajeev, Fisman, Dana, Singh, Rishabh and Solar-Lezama, Armando. 2016. "SyGuS-Comp 2016: Results and Analysis." 229.
Version
Final published version
Abstract
© R. Alur, D. Fisman, R. Singh & A. Solar-Lezama. 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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution 4.0 International license
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.4204/eptcs.229.13
