CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories

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.

Experience Report: Towards Moving Things with Types - Helping Logistics Domain Experts to Control Cyber-Physical Systems with Type-Based Synthesis

“…It is specifically focused to improve comprehensibility and traceability of the inhabitant search process. The IDE provides a graphical overview of the inhabitants generated by the algorithm in form of hypergraphs [8,12]. We developed a step-wise build of the hypergraphs in order to explain the generation of solutions.…”

“…We also developed a filtering function based on satisfiability modulo theories (SMT) [12]. In this way, additional constraints can be used to restrict the set of inhabitants and avoid trivial solutions such as reverse(reverse(s)) for some sequence s. The IDE supports adding and removing some domain-independent structural constraints, which are helpful in many situations.…”

Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic

“…An improvement of the abstraction algorithm using families of combinators is proposed in [28]. A more recent work attempt to solve combinatory logic synthesis problems using a SMT solvers [26]. Matiyasevich proved [32] that every enumerable set is a Diophantine set.…”