Syntax-Guided Synthesis
Name
SyGuS_JournalVersion.pdf
Description
Accepted version
Size
2.61 MB
Format
Unknown
Checksum (MD5)
be14e1285d0fd39ceb9d03229f63f37d
Author(s)
Alur, Rajeev
Bodik, Rastislav
Dallal, Eric
Fisman, Dana
Garg, Pranav
Juniwal, Garvit
Kress-Gazit, Hadas
Madhusudan, P.
Martin, Milo M. K.
Raghothaman, Mukund
Date Issued
2015
Publisher
IOS Press
Citation
Solar Lezama, Armando. 2015. "Syntax-Guided Synthesis."
Version
Author's final manuscript
Abstract
The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and program optimization illustrates many potential benefits of allowing the user to supplement the logical specification with a syntactic template that constrains the space of allowed implementations. Our goal is to identify the core computational problem common to these proposals in a logical framework. The input to the syntax-guided synthesis problem (SyGuS) consists of a background theory, a semantic correctness specification for the desired program given by a logical formula, and a syntactic set of candidate implementations given by a grammar. The computational problem then is to find an implementation from the set of candidate expressions so that it satisfies the specification in the given theory. We describe alternative solution strategies that combine learning, counterexample analysis and constraint solving. We report on prototype implementations, and present experimental results on the set of benchmarks collected as part of the first SyGuS-Comp competition held in July 2014.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.3233/978-1-61499-495-4-1
