2010
DOI: 10.1007/978-3-642-13595-8_3
|View full text |Cite
|
Sign up to set email alerts
|

Comparing Approaches to Implement Feature Model Composition

Abstract: Abstract. The use of Feature Models (FMs) to define the valid combinations of features in Software Product Lines (SPL) is becoming commonplace. To enhance the scalability of FMs, support for composing FMs describing different SPL aspects is needed. Some composition operators, with interesting property preservation capabilities, have already been defined but a comprehensive and efficient implementation is still to be proposed. In this paper, we systematically compare strengths and weaknesses of different implem… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
57
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 49 publications
(57 citation statements)
references
References 24 publications
0
57
0
Order By: Relevance
“…reasoning, customizability, traceability and composability capacities, as well as quality of the resulting feature diagram (Section 5). We show that existing works [6,8,26] and our past attempts [15,25] can benefit from the new proposed techniques when reasoning, synthesizing feature diagrams, aligning FMs or simply devising new composition-based operators. As a result, the contributions of this paper are:…”
Section: Introductionmentioning
confidence: 89%
See 3 more Smart Citations
“…reasoning, customizability, traceability and composability capacities, as well as quality of the resulting feature diagram (Section 5). We show that existing works [6,8,26] and our past attempts [15,25] can benefit from the new proposed techniques when reasoning, synthesizing feature diagrams, aligning FMs or simply devising new composition-based operators. As a result, the contributions of this paper are:…”
Section: Introductionmentioning
confidence: 89%
“…Then the composition operator is denoted (or translated) in the Boolean logic. If we consider the case of union (see the first illustrative example), the denotational operator roughly corresponds to a disjunction of formulae (details have been given in [25]). Similar denotations can be applied for computing the intersection, diff, reduced product, etc.…”
Section: Denotational-based Composition (Logic-based)mentioning
confidence: 99%
See 2 more Smart Citations
“…The combination of product lines and model transformations has been extensively studied from the perspective of using transformations for configuring and refining product lines [10,15,17,11], and merging products and feature models [3,9,26], A theory of product line refinement along with a classification of commonly used refinement approaches is presented in [7]. Transformation lifting di↵ers from these works because it is about adapting existing product-level transformations to the level of entire product lines, as opposed to creating transformations specifically for product lines.…”
Section: Related Workmentioning
confidence: 99%