2015
DOI: 10.1145/2746235
|View full text |Cite
|
Sign up to set email alerts
|

Component-Based Synthesis of Embedded Systems Using Satisfiability Modulo Theories

Abstract: Constraint programming solvers, such as Satisfiability Modulo Theory (SMT) solvers, are capable tools in finding preferable configurations for embedded systems from large design spaces. However, constructing SMT constraint programs is not trivial, in particular for complex systems that exhibit multiple viewpoints and models. In thisarticle we propose CoDeL: a component-based description language that allows system designers to express components as reusable building blocks of the system with their parameteriza… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 40 publications
0
4
0
Order By: Relevance
“…However, as soon as software layers differ, a particular component might need to be integrated differently when deployed on another hardware component. There are approaches that explicitly address the software composition problem [21] using constraint-based methods such as SMT [21] or Mixed Integer Linear Programming (MILP) [14], however, they do not consider composite components. As soon as the number of required software components, tasks, etc.…”
Section: Related Workmentioning
confidence: 99%
“…However, as soon as software layers differ, a particular component might need to be integrated differently when deployed on another hardware component. There are approaches that explicitly address the software composition problem [21] using constraint-based methods such as SMT [21] or Mixed Integer Linear Programming (MILP) [14], however, they do not consider composite components. As soon as the number of required software components, tasks, etc.…”
Section: Related Workmentioning
confidence: 99%
“…Early approaches were based on constraint satisfaction and constraint logic programming [17], [24], [25]. More recent approaches utilize SAT and SMT solvers [16], [18], [26], and counterexample-guided inductive synthesis and relational model finding [20], [27] for dynamic configuration. However, the way these approaches reduce configuration problems to constraint satisfaction problems is significantly different from our approach using input/output examples and unrolling.…”
Section: Related Workmentioning
confidence: 99%
“…The main limitation of these approaches is that the software composition is already known and fixed. There are approaches that explicitly address the software composition problem using constraint-based methods such as SMT [9] or Mixed Integer Linear Programming (MILP) [10], however, they do not consider cases in which the number of component varies (cf. Fig.…”
Section: State-of-the-art and Related Workmentioning
confidence: 99%