SyGuS-Comp 2016: Results and analysis

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 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 languageEnglish GB
Title of host publicationElectronic Proceedings in Theoretical Computer Science, EPTCS
PublisherOpen Publishing Association
Pages178-202
Number of pages25
Volume229
DOIs
StatePublished - 22 Nov 2016
Event5th Workshop on Synthesis, SYNT 2016 - Toronto, Canada
Duration: 17 Jul 201618 Jul 2016

Conference

Conference5th Workshop on Synthesis, SYNT 2016
Country/TerritoryCanada
CityToronto
Period17/07/1618/07/16

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'SyGuS-Comp 2016: Results and analysis'. Together they form a unique fingerprint.

Cite this