BoSy: An Experimentation Framework for Bounded Synthesis

by   Peter Faymonville, et al.

We present BoSy, a reactive synthesis tool based on the bounded synthesis approach. Bounded synthesis ensures the minimality of the synthesized implementation by incrementally increasing a bound on the size of the solutions it considers. For each bound, the existence of a solution is encoded as a logical constraint solving problem that is solved by an appropriate solver. BoSy constructs bounded synthesis encodings into SAT, QBF, DQBF, EPR, and SMT, and interfaces to solvers of the corresponding type. When supported by the solver, BoSy extracts solutions as circuits, which can, if desired, be verified with standard hardware model checkers. BoSy won the LTL synthesis track at SYNTCOMP 2016. In addition to its use as a synthesis tool, BoSy can also be used as an experimentation and performance evaluation framework for various types of satisfiability solvers.


page 1

page 2

page 3

page 4


Encodings of Bounded Synthesis

The reactive synthesis problem is to compute a system satisfying a given...

Satisfiability and Synthesis Modulo Oracles

In classic program synthesis algorithms, such as counterexample-guided i...

SyGuS Techniques in the Core of an SMT Solver

We give an overview of recent techniques for implementing syntax-guided ...

Live Synthesis

Synthesis automatically constructs an implementation that satisfies a gi...

Symbolic vs. Bounded Synthesis for Petri Games

Petri games are a multiplayer game model for the automatic synthesis of ...

CVC4SY for SyGuS-COMP 2019

CVC4Sy is a syntax-guided synthesis (SyGuS) solver based on bounded term...

Enumeration, structural and dimensional synthesis of robotic hands: theory and implementation

Designing robotic hands for specific tasks could help in the creation of...