23 citations · 68 across the 21 of their papers we have counts for
3 papers · 1 filter
SyGuS Techniques in the Core of an SMT Solver
Andrew Reynolds, Cesare Tinelli
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…
Constraint Solving for Finite Model Finding in SMT Solvers
Andrew Reynolds, Cesare Tinelli, Clark Barrett
SMT solvers have been used successfully as reasoning engines for automated verification and other applications based on automated reasoning. Current techniques for dealing with qua…
Reasoning with Finite Sets and Cardinality Constraints in SMT
Kshitij Bansal, Clark Barrett, Andrew Reynolds +1
We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data stru…