Results and Analysis of SyGuS-Comp'15
Author(s)
Alur, Rajeev; Fisman, Dana; Singh, Rishabh; Solar Lezama, Armando
DownloadResults and analysis.pdf (665.4Kb)
PUBLISHER_CC
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
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 two specialized tracks: a track for conditional linear arithmetic, where the grammar need not be specified and is implicitly assumed to be that of the LIA logic of SMT-LIB, and a track for invariant synthesis problems, with special constructs conforming to the structure of an invariant synthesis problem. This paper presents and analyzes the results of SyGuS-comp'15.
Date issued
2016-02Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Electronic Proceedings in Theoretical Computer Science
Publisher
Open Publishing Association
Citation
Alur, Rajeev, et al. “Results and Analysis of SyGuS-Comp’15.” Electronic Proceedings in Theoretical Computer Science, vol. 202, Feb. 2016, pp. 3–26.
Version: Final published version
ISSN
2075-2180