Results and Analysis of SyGuS-Comp'15

Rajeev Alur
(University of Pennsylvania)
Dana Fisman
(University of Pennsylvania)
Rishabh Singh
(Microsoft Research)
Armando Solar-Lezama
(Massachusetts Institute of Technology)

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.

In Pavol Černý, Viktor Kuncak and Madhusudan Parthasarathy: Proceedings Fourth Workshop on Synthesis (SYNT 2015), San Francisco, CA, USA, 18th July 2015, Electronic Proceedings in Theoretical Computer Science 202, pp. 3–26.
Published: 2nd February 2016.

ArXived at: https://dx.doi.org/10.4204/EPTCS.202.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org