The 3rd Syntax Guided Synthesis Competition will take place as a satellite event of CAV and SYNT 2016 .

Benchmark submission deadline: 30 May 2016

Solver submission deadline:14 June 2016

Competition date: 28 June 2015

Results published: 14 July 2016

Solver presentations: 17 July 2016 (with SYNT)

Benchmark submission

Solver submission

This is a call for participation for the 3rd Syntax-Guided Synthesis Competition to be organized as a satellite event of SYNT/CAV 2015. 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 implementation. The motivation is twofold. First, narrowing the space of implementations makes the synthesis problem more tractable. Second, providing a specific syntax can potentially lead to better optimizations.

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 that satisfies the specification in the given theory.

There has been a lot of recent interest in both developing and using SyGuS solvers for various synthesis applications and also for developing different solving algorithms. The SyGuS-Comp competition will allow solvers to compete on a collection of benchmarks and advance the state-of-the-art for program-synthesis tools. The competition is organized as part of NSF Expeditions in Computing project ExCAPE by Rajeev Alur (Penn), Dana Fisman (Penn), Rishabh Singh (Microsoft Research) and Armando Solar-Lezama (MIT). For questions regarding the competition please contact the organizers at sygus-organizers@seas.upenn.edu.

This year we will be having 4 tracks. In addition to the three tracks from last yearâ€™s competition (1) General SyGuS track (2) Invariant Synthesis track, and (3) Conditional Linear Integer Arithmetic track), we will be having a new track: track (4) on Programming By Examples (PBE), where the specification constraint would be defined using only input-output examples. We expect to have the ICFP 2013 programming contest bitvector benchmarks and FlashFill public benchmarks for this category. More details about the tracks can be found in the extended SyGuS-IF. The results of the 2nd SyGuS competition can be found here.

We will evaluate the solvers on a subset of public benchmarks and some secret benchmarks. The domains of benchmarks include bit-vector manipulation, including bit-vector algorithms, concurrency, robotics, and invariant generation. We are still finalizing the set of benchmarks, and would appreciate your contribution to the benchmarks as well.

Evaluation of the solvers will be done on the StarExec system (200 dual quad-core machines with 256GB memory each). The solvers would be run with a TIMEOUT value. The SyGuS-correctness checker, as well as two the solvers from last year's competition are available on the SyGuS community at StarExec. Candidate participants are invited to register to StarExec where they can easily and discreetly compare their solvers to the initial ones against the public benchmarks. The scoring will take into account the number of benchmark solved, the solving time and the size of the synthesized solution.

We expect the tool developers to test their solvers on the public benchmarks, and submit the solver binaries by the Solver submission deadline. Each solver submission should be accompanied by a 1-2 page (IEEE format) description of the key ideas of the solvers.

All benchmarks will be made public after the competition. We encourage the tool developers to make their solvers open-source, but participants are welcomed to submit binaries of proprietary tools as well.