Proceedings of the 16th International Software Product Line Conference - Volume 1 2012
DOI: 10.1145/2362536.2362553
|View full text |Cite
|
Sign up to set email alerts
|

Efficient synthesis of feature models

Abstract: Variability modeling, and in particular feature modeling, is a central element of model-driven software product line architectures. Such architectures often emerge from legacy code, but, unfortunately creating feature models from large, legacy systems is a long and arduous task.We address the problem of automatic synthesis of feature models from propositional constraints. We show that this problem is NP-hard. We design efficient techniques for synthesis of models from respectively CNF and DNF formulas, showing… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
63
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 50 publications
(63 citation statements)
references
References 36 publications
0
63
0
Order By: Relevance
“…The same observation applies for the slicing operation so that reasoning directly at the semantic level is required. The key ideas of our approach are to i) compute the propositional formula representing the projected set of configurations and then ii) reuse the reasoning techniques proposed in [21,11,8] to construct an FM from the propositional formula. We rely on the algorithm developed in [5] that combines this information with the known hierarchy of the slice (see Definition 6) in order to build a complete and valid FM.…”
Section: Automationmentioning
confidence: 99%
“…The same observation applies for the slicing operation so that reasoning directly at the semantic level is required. The key ideas of our approach are to i) compute the propositional formula representing the projected set of configurations and then ii) reuse the reasoning techniques proposed in [21,11,8] to construct an FM from the propositional formula. We rely on the algorithm developed in [5] that combines this information with the known hierarchy of the slice (see Definition 6) in order to build a complete and valid FM.…”
Section: Automationmentioning
confidence: 99%
“…Andersen et. al propose algorithms to reverse engineer feature models from propositional logic formulas, these formulas are either in disjunctive normal form (DNF) or conjunctive normal form (CNF) [16]. Note here that while an FST can be viewed as a propositional logic formula in DNF, our approach is very different from Andersen et.…”
Section: Related Workmentioning
confidence: 99%
“…Second we compute a directed minimum spanning tree (MST) of BIG c that maximises the parent-child relationships of input FM hierarchies. Finally, other components of the feature diagrams can be synthesized [19,32]. In Fig.…”
Section: Denotational-based Composition (Logic-based)mentioning
confidence: 99%
“…For instance, the operational-based composition has the worst maximality since the resulting feature diagram is a super-set of all combinations of features and is a very rough over-approximation of s. In particular, the feature F2 is optional in the feature diagram whereas it is always included in every configuration. The other variants have the best possible maximality since they all rely on the logical synthesis technique that is known to produce a maximal feature diagram [32].…”
Section: Comparison Framework and Reading Gridmentioning
confidence: 99%