SyGuS-Comp 2016: Results and Analysis

Rajeev Alur
(University of Pennsylvania)
Dana Fisman
(Ben-Gurion University)
Rishabh Singh
(Microsoft Research, Redmond)
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 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.

In Ruzica Piskac and Rayna Dimitrova: Proceedings Fifth Workshop on Synthesis (SYNT 2016), Toronto, Canada, July 17-18, 2016, Electronic Proceedings in Theoretical Computer Science 229, pp. 178–202.
Published: 22nd November 2016.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: