Results and Analysis of SyGuS-Comp'15
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...
Main Authors: | Rajeev Alur, Dana Fisman, Rishabh Singh, Armando Solar-Lezama |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2016-02-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1602.01170v1 |
Similar Items
-
Results and Analysis of SyGuS-Comp'15
by: Alur, Rajeev, et al.
Published: (2018) -
SyGuS-Comp 2017: Results and Analysis
by: Rajeev Alur, et al.
Published: (2017-11-01) -
SyGuS-Comp 2016: Results and Analysis
by: Rajeev Alur, et al.
Published: (2016-11-01) -
SyGuS-Comp 2016: Results and Analysis
by: Alur, Rajeev, et al.
Published: (2021) -
SyGuS Techniques in the Core of an SMT Solver
by: Andrew Reynolds, et al.
Published: (2017-11-01)