Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers

Abstract

SMT solvers are at the heart of a number of software engineering tools. These SMT solvers use a SAT solver as the back-end and convert the high-level constraints given by the user down to low-level boolean formulas that can be efficiently mapped to CNF clauses and fed into a SAT solver. Current SMT solvers are designed to be general purpose solvers that are suited to a wide range of problems. However, SAT solvers are very non-deterministic and hence, it is difficult to optimize a general purpose solver across all different problems. In this thesis, we propose a system that can automatically generate parts of SMT solvers in a way that is tailored to particular problem domains. In particular, we target the translation from high-level constraints to CNF clauses which is one of the crucial parts of all SMT solvers. We achieve this goal by using a combination of program synthesis and machine learning techniques. We use a program synthesis tool called Sketch to generate optimal encoding rules for this translation and then use auto-tuning to only select the subset of these encodings that actually improve the performance for a particular class of problems.Using this technique, the thesis shows that we can improve upon the basic encoding strategy used by CVC4 (a state of the art SMT solver). We can automatically generate variants of the solver tailored to different domains of problems represented in the bit-vector benchmark suite from the SMT competition 2015.

Resource-guided program synthesis

“…[18-20, 22, 35, 39, 46, 50, 51, 59, 62, 69, 70] do not explicitly take resource usage into account during synthesis. Many of them, however, leverage domain knowledge to restrict the search space to only include efficient programs [14,25] or to encode domain-specific performance considerations as part of the functional specification [36,43,44].…”

The three pillars of machine programming

“…Even with a restrictive set of primitives, the search-space grows exponentially with the size of the code-fragments that one aims to discover, making it difficult to scale beyond a dozen or so lines of code. There are some instances of systems that have been able to discover more complex algorithms, either by building them incrementally [54], or by breaking down the problem into smaller pieces-either by providing the synthesizer with the interfaces of sub-components to use [57], or by leveraging some domain-specific structure of the problem to decompose it into a large number of independent sub-problems [34].…”

Program Sketching by Automatically Generating Mocks from Tests

“…Program synthesis by sketching, as embodied by the Sketch synthesis tool [30], is a popular technique that has been applied to a wide variety of problems [5,7,13,14,15,16,18,22,29]. A Sketch input (henceforth a sketch) is a program written in a C-like language augmented with holes, unknown constants, and generators, unknown expressions.…”