SyGuS Techniques in the Core of an SMT Solver

11/29/2017
by   Andrew Reynolds, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/28/2021

Satisfiability and Synthesis Modulo Oracles

In classic program synthesis algorithms, such as counterexample-guided i...
research
07/23/2019

CVC4SY for SyGuS-COMP 2019

CVC4Sy is a syntax-guided synthesis (SyGuS) solver based on bounded term...
research
04/13/2018

On Solving Quantified Bit-Vectors using Invertibility Conditions

We present a novel approach for solving quantified bit-vector formulas i...
research
01/16/2014

Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories

The problem of finding small unsatisfiable cores for SAT formulas has re...
research
04/12/2019

SyGuS-Comp 2018: Results and Analysis

Syntax-guided synthesis (SyGuS) is the computational problem of finding ...
research
03/26/2018

BoSy: An Experimentation Framework for Bounded Synthesis

We present BoSy, a reactive synthesis tool based on the bounded synthesi...
research
08/04/2022

Core Challenge 2022: Solver and Graph Descriptions

This paper collects all descriptions of solvers and ISR instances submit...

Please sign up or login with your details

Forgot password? Click here to reset