2000 character limit reached
CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories (1908.09481v1)
Published 26 Aug 2019 in cs.LO and cs.FL
Abstract: We introduce an approach that aims to combine the usage of satisfiability modulo theories (SMT) solvers with the Combinatory Logic Synthesizer (CL)S framework. (CL)S is a tool for the automatic composition of software components from a user-specified repository. The framework yields a tree grammar that contains all composed terms that comply with a target type. Type specifications for (CL)S are based on combinatory logic with intersection types. Our approach translates the tree grammar into SMT functions, which allows the consideration of additional domain-specific constraints. We demonstrate the usefulness of our approach in several experiments.