SyGuS-Comp 2018: Results and Analysis

04/12/2019
by   Rajeev Alur, et al.
0

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 the SyGuS input format (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 the 5th SyGuS-Comp, five solvers competed on over 1600 benchmarks across various tracks. This paper presents and analyses the results of this year's (2018) SyGuS competition.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset