Logo image
CVC4SY: Smart and Fast Term Enumeration for Syntax-Guided Synthesis
Conference proceeding   Open access   Peer reviewed

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

Andrew Reynolds, Haniel Barbosa, Andres Notzli, Clark Barrett and Cesare Tinelli
COMPUTER AIDED VERIFICATION, CAV 2019, PT II, Vol.11562, pp.74-83
Lecture Notes in Computer Science
01/01/2019
DOI: 10.1007/978-3-030-25543-5_5
url
https://doi.org/10.1007/978-3-030-25543-5_5View
Published (Version of record) Open Access

Abstract

We present CVC4SY, a syntax-guided synthesis (SyGuS) solver based on three bounded term enumeration strategies. The first encodes term enumeration as an extension of the quantifier-free theory of algebraic datatypes. The second is based on a highly optimized brute-force algorithm. The third combines elements of the others. Our implementation of the strategies within the satisfiability modulo theories (SMT) solver CVC4 and a heuristic to choose between them leads to significant improvements over state-of-the-art SyGuS solvers.
Computer Science Technology Computer Science, Software Engineering Computer Science, Theory & Methods Science & Technology

Details

Metrics

Logo image