The SyGuS Language Standard Version 2.1
Abstract: The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Syntax-guided synthesis (SyGuS) is a standardized format for specifying the correctness specification with a syntactic template that constrains the space of allowed implementations. The input to 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 that satisfies the specification in the given theory. The formulation of the problem builds on SMT-LIB. This document defines the SyGuS 2.1 standard, which is intended to be used as the standard input and output language for solvers targeting the syntax-guided synthesis problem. It borrows many concepts and language constructs from the standard format for Satisfiability Modulo Theories (SMT) solvers, the SMT-LIB 2.6 standard.
- SyGuS Syntax for SyGuS-COMP 15. http://sygus.org, 2015.
- SyGuS Syntax for SyGuS-COMP 16. http://sygus.org, 2016.
- The SMT-LIB Standard: Version 2.6. Technical report, Department of Computer Science, The University of Iowa, 2017. Available at www.SMT-LIB.org.
- A theory of formal synthesis via inductive learning. Acta Informatica, 54(7):693–726, 2017.
- Language to specify syntax-guided synthesis problems. 2014.
- Proposal for a theory of tables. 2021.
- Unicode Strings (Draft 1.0). http://smtlib.cs.uiowa.edu/theories-UnicodeStrings.shtml, 2018.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.