cvc4sy: Smart and Fast Term Enumeration for Syntax-Guided Synthesis

Reynolds, Andrew; Barbosa, Haniel; Nötzli, Andres; Barrett, Clark; Tinelli, Cesare

doi:10.1007/978-3-030-25543-5_5

Cited by 58 publications

(34 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our SyQI technique is implemented as a module of the subsolver of CVC4 that handles quantified formulas. We leverage CVC4's support for smart enumerative SyGuS as described in Reynolds et al [22]. Specifically, the check method in line 7 in Algorithm 1 involves calling the (combination) of quantifier-free theory solvers, which includes an extension of the theory of datatypes described in the following.…”

Section: Implementation Detailsmentioning

confidence: 99%

“…Symmetry Breaking for Smart Enumerative Synthesis. As described in previous work [22,24], CVC4 uses advanced techniques for symmetry breaking for the datatypes over which context-free grammars are embedded. The quantifier-free datatype theory solver in CVC4 is extended to issue symmetry blocking clauses based on reasoning about such datatypes, so that the models we generate for a datatype variable d are such that to term(d) is unique with respect to rewriting.…”

Section: Implementation Detailsmentioning

confidence: 99%

“…In previous work [22,24], a smart enumerative approach for syntax-guided synthesis was presented and implemented in CVC4. In that work, the generation of terms is based on finding solutions for an evolving set of constraints in an extension of the quantifier-free fragment of algebraic datatypes, for which some SMT solvers have dedicated decision procedures [3,23].…”

Section: Introductionmentioning

confidence: 99%

“…Our approach for syntax-guided instantiation relies on a notion of evaluation variables. A related, more general, notion of evaluation functions was used in the context of syntax-guided synthesis (see Section 2 of [22] for details). Let d be a term of a datatype sort encoding a grammar over terms of sort σ.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Syntax-Guided Quantifier Instantiation

Niemetz

Preiner

Reynolds

et al. 2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

This paper presents a novel approach for quantifier instantiation in Satisfiability Modulo Theories (SMT) that leverages syntax-guided synthesis (SyGuS) to choose instantiation terms. It targets quantified constraints over background theories such as (non)linear integer, reals and floating-point arithmetic, bit-vectors, and their combinations. Unlike previous approaches for quantifier instantiation in these domains which rely on theory-specific strategies, the new approach can be applied to any (combined) theory, when provided with a grammar for instantiation terms for all sorts in the theory. We implement syntax-guided instantiation in the SMT solver CVC4, leveraging its support for enumerative SyGuS. Our experiments demonstrate the versatility of the approach, showing that it is competitive with or exceeds the performance of state-of-the-art solvers on a range of background theories.

show abstract

Section: Implementation Detailsmentioning

confidence: 99%

Section: Implementation Detailsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Syntax-Guided Quantifier Instantiation

Niemetz

Preiner

Reynolds

et al. 2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Figure 1 shows the regex validation synthesis pipeline. Both stages of our synthesis algorithm employ enumerative search, a common approach to solve the problem of program synthesis [4,5,10,17,21]. The enumerative search cycle is depicted in Figure 2.…”

Section: Synthesis Algorithm Overviewmentioning

confidence: 99%

FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions

Ferreira

Terra-Neves²,

Ventura³

et al. 2021

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Form validators based on regular expressions are often used on digital forms to prevent users from inserting data in the wrong format. However, writing these validators can pose a challenge to some users.We present Forest, a regular expression synthesizer for digital form validations. Forest produces a regular expression that matches the desired pattern for the input values and a set of conditions over capturing groups that ensure the validity of integer values in the input. Our synthesis procedure is based on enumerative search and uses a Satisfiability Modulo Theories (SMT) solver to explore and prune the search space. We propose a novel representation for regular expressions synthesis, multi-tree, which induces patterns in the examples and uses them to split the problem through a divide-and-conquer approach. We also present a new SMT encoding to synthesize capture conditions for a given regular expression. To increase confidence in the synthesized regular expression, we implement user interaction based on distinguishing inputs.We evaluated Forest on real-world form-validation instances using regular expressions. Experimental results show that Forest successfully returns the desired regular expression in 70% of the instances and outperforms Regel, a state-of-the-art regular expression synthesizer.

show abstract

The effect of distance metrics in a general purpose synthesizer: An empirical study on integer domain imperative programs

2021

View full text Add to dashboard Cite

Context: Program synthesis is the task of automatically finding a program that satisfies the user intention. In previous work, we have developed a program synthesizer that integrates genetic algorithm with model finder. A genetic algorithm uses a fitness function to calculate how "distant to a solution" a given candidate program is. Researchers argue that different distance metrics for a fitness function may reveal behavioral differences in the genetic algorithm. Objective:We have chosen five distance metrics as fitness functions to check whether they affect the synthesis task of five different integer domain imperative toy-programs which read/write integer values using fundamental syntactic constructs, such as while, if-then-else, and so forth. We have used input/output examples and sketches to constrain the search space of the candidate programs.Method: A hypothesis test was proposed and experiments were conducted to observe the number of calls to the fitness function (x) and to measure the synthesis time (x st ).Results: Regarding x, the synthesizer found a solution for all five subjects after calling the fitness function the same amount of times. For x st , a one-way ANOVA was performed with a significance level of 5% (𝛼 = 0.05). No significant differences were observed in both x and x st . Conclusion:With these preliminary results, this study suggests that the discrete distance metric is the best choice, because it guides the search with the same effectiveness as the others and is not time consuming, and so forth. However, future experimentation with a larger search space will confirm or not this initial impression.

show abstract

cvc4sy: Smart and Fast Term Enumeration for Syntax-Guided Synthesis

Cited by 58 publications

References 16 publications

Syntax-Guided Quantifier Instantiation

Syntax-Guided Quantifier Instantiation

FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions

The effect of distance metrics in a general purpose synthesizer: An empirical study on integer domain imperative programs

Contact Info

Product

Resources

About