SyGuS Techniques in the Core of an SMT Solver
classification
💻 cs.LO
keywords
techniquescoresygussynthesisalgorithmsclassclassesconjecture
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.