CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories
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...
Main Authors: | Fadil Kallat, Tristan Schäfer, Anna Vasileva |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2019-08-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1908.09481v1 |
Similar Items
-
Satisfiability modulo relations: theory and applications
by: Meng, Baoluo
Published: (2018) -
Finite model finding in satisfiability modulo theories
by: Reynolds, Andrew Joseph
Published: (2013) -
A Framework for Autonomous Generation of Strategies in Satisfiability Modulo Theories
by: Galvez Ramirez, Nicolas
Published: (2018) -
lematema.cls
by: Renato Maggioni
Published: (2009-11-01) -
Finding inductive invariants using satisfiability modulo theories and convex optimization
by: Karpenkov, George Egor
Published: (2017)