TY - GEN
T1 - Results and analysis of SyGuS-Comp'15
AU - Alur, Rajeev
AU - Fisman, Dana
AU - Singh, Rishabh
AU - Solar-Lezama, Armando
N1 - Publisher Copyright:
© R. Alur, D. Fisman, R. Singh & A. Solar-Lezama.
PY - 2015
Y1 - 2015
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84991735362&partnerID=8YFLogxK
U2 - 10.4204/EPTCS.202.3
DO - 10.4204/EPTCS.202.3
M3 - פרסום בספר כנס
AN - SCOPUS:84991735362
VL - 202
T3 - Electronic Proceedings in Theoretical Computer Science, EPTCS
SP - 3
EP - 26
BT - Electronic Proceedings in Theoretical Computer Science, EPTCS
PB - Open Publishing Association
T2 - 4th Workshop on Synthesis, SYNT 2015
Y2 - 18 July 2015
ER -