Program Synthesis as Dependency Quantified Formula Modulo Theory

by   Priyanka Golia, et al.

Given a specification Ο†(X,Y) over inputs X and output Y, defined over a background theory 𝕋, the problem of program synthesis is to design a program f such that Y=f(X) satisfies the specification Ο†. Over the past decade, syntax-guided synthesis (SyGuS) has emerged as a dominant approach for program synthesis where in addition to the specification Ο†, the end-user also specifies a grammar L to aid the underlying synthesis engine. This paper investigates the feasibility of synthesis techniques without grammar, a sub-class defined as 𝕋-constrained synthesis. We show that 𝕋-constrained synthesis can be reduced to DQF(𝕋), i.e., to the problem of finding a witness of a Dependency Quantified Formula Modulo Theory. When the underlying theory is the theory of bitvectors, the corresponding DQF(BV) problem can be further reduced to Dependency Quantified Boolean Formulas (DQBF). We rely on the progress in DQBF solving to design DQBF-based synthesizers that outperform the domain-specific program synthesis techniques, thereby positioning DQBF as a core representation language for program synthesis. Our empirical analysis shows that 𝕋-constrained synthesis can achieve significantly better performance than syntax-guided approaches. Furthermore, the general-purpose DQBF solvers perform on par with domain-specific synthesis techniques.


page 1

page 2

page 3

page 4

βˆ™ 11/29/2017

SyGuS-Comp 2017: Results and Analysis

Syntax-Guided Synthesis (SyGuS) is the computational problem of finding ...
βˆ™ 04/12/2019

SyGuS-Comp 2018: Results and Analysis

Syntax-guided synthesis (SyGuS) is the computational problem of finding ...
βˆ™ 07/20/2020

SynRG: Syntax Guided Synthesis of Expressions with Alternating Quantifiers

Program synthesis is the task of automatically generating expressions th...
βˆ™ 03/26/2018

Encodings of Bounded Synthesis

The reactive synthesis problem is to compute a system satisfying a given...
βˆ™ 09/08/2022

Template-based Program Synthesis using StellensΓ€tze

Template-based synthesis, also known as sketching, is a localized approa...
βˆ™ 05/17/2019

Overfitting in Synthesis: Theory and Practice (Extended Version)

In syntax-guided synthesis (SyGuS), a synthesizer's goal is to automatic...
βˆ™ 11/04/2016

QBF Solving by Counterexample-guided Expansion

We introduce a novel generalization of Counterexample-Guided Inductive S...