Andrew Reynolds (University of Iowa) |
Cesare Tinelli (University of Iowa) |
We give an overview of recent techniques for implementing syntax-guided synthesis (SyGuS) algorithms in the core of Satisfiability Modulo Theories (SMT) solvers. We define several classes of synthesis conjectures and corresponding techniques that can be used when dealing with each class of conjecture. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.260.8 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |