The 2nd Syntax-Guided Synthesis Competition (SyGuS-Comp) will take place as a satellite event of CAV and SYNT 2015.
UPDATE: SyGuS-Comp 2015 has concluded (Results). Congratulations to all winners.
|18 July 2015||Solvers presentation (at SYNT’15 workshop)|
Call for Participation
This is a call for participation in the 2nd Syntax-Guided Synthesis Competition to be organized as a satellite event of SYNT and 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. The formulation of the problem builds on SMT-LIB.
There has been a lot of recent interest in both using SyGuS solvers for various synthesis applications and developing different solving algorithms. The SyGuS competition (SyGuS-Comp’15) will allow solvers to compete on a large collection of benchmarks and advance the state-of-the-art for program-synthesis tools. We invite authors to submit their SyGuS solvers to this year’s SyGuS Competition.
For questions regarding the competition please contact the organizers at firstname.lastname@example.org.
This year’s competition will have 4 tracks:
- General SyGuS track (General),
- Invariant synthesis track (Inv), and
- Conditional Linear Integer Arithmetic track (CLIA)
Check the specification language for more details on the formulation of the problems for these tracks.
Solvers will be evaluated on the StarExec platform, which provided 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 the solvers from last year’s competition are available on the SyGuS community at StarExec. Candidate participants are invited to register on StarExec, where they can easily compare their solvers to the previous ones against the public benchmarks.
The solvers scores will be based primarily on the number of benchmark solved and the solving time, and secondarily on the succinctness of the synthesized solution.
Tool Submission and Description
We expect tool developers to test their solvers on the public benchmarks, and submit the solver binaries on StarExec by the solver submission deadline. Each solver submission should also be accompanied by a brief (1 – 2 page in IEEE format) description of the key ideas of the solver.
Licensing of Tools and Benchmarks:
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.
Eight solvers participated in SyGuS-Comp’15:
- Alchemist-CS (in CLIA and Inv tracks)
Daniel Neider (UIUC), Shambwaditya Saha (UIUC) and P. Madhusudan (UIUC)
- Alchemist-CSDT (in CLIA track)
Shambwaditya Saha (UIUC), Daniel Neider (UIUC) and P. Madhusudan (UIUC)
- CVC4 1.5 (in all 4 tracks)
Andrew Reynolds (University of Iowa), Cesare Tinelli (University of Iowa), Clark Barrett (Stanford University), Morgan Deters (New York University) and Tim King (Google)
- Enumerative (in General and PBE tracks)
Abhishek Udupa (University of Pennsylvania)
- ICE-DT (in Inv track)
Daniel Neider (UIUC), P. Madhusudan (UIUC) and Pranav Garg (UIUC)
- Sketch-AC (in General and PBE tracks)
Jinseong Jeon (University of Maryland), Xiaokang Qiu (Massachusetts Institute of Technology), Armando Solar-Lezama (Massachusetts Institute of Technology) and Jeffrey S. Foster (University of Maryland)
- SosyToast (in General track)
Heinz Riener (DLR) and Ruediger Ehlers (DLR)
- Stochastic (in General and PBE tracks)
Mukund Raghothaman (University of Pennsylvania)
The winners for various tracks are as follows.
- Inv Track: ICE-DT
- CLIA Track: CVC4
- General Track: CVC4
A detailed final report is also available here.