Reasoning about edits to feature models

Thüm, Thomas; Batory, Don; Kästner, Christian

doi:10.1109/icse.2009.5070526

Cited by 243 publications

(252 citation statements)

References 37 publications

Supporting

Mentioning

250

Contrasting

Unclassified

Order By: Relevance

“…Semi-completeness is useful (as an auxiliary intermediate step to completeness, but also) for some important practical problems in feature modeling such as refactoring and specialization [38] and some other analysis operations [4] over models. (See Sect.…”

Section: Modal Logic Theory Of Feature Modelsmentioning

confidence: 99%

“…Model refactoring is important for the practice of feature modeling [38]. The goal of refactoring is to replace a given model M with a syntactically different but semantically equivalent model M , i.e., having the same (partial) products.…”

Section: Feature Model Refactoringmentioning

confidence: 99%

“…For example, it is often important to know if one model M 1 is a refactoring of another model M 2 , or a specialization of M 2 , or neither [38]. Standard definitions of refactoring and specialization are based on semantics, which in the Boolean case gives rise to defining refactoring…”

Section: Analysis Of Modelsmentioning

confidence: 99%

See 2 more Smart Citations

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic

Diskin¹,

Safilian²,

Maibaum³

et al. 2016

SACS

View full text Add to dashboard Cite

Software product lines are now an established framework for software design. They are specified by special diagrams called feature models. For formal analysis, the latter are usually encoded by Boolean propositional theories. We discuss a major deficiency of this semantics, and show that it can be fixed by considering a product to be an instantiation process rather than its final result. We call intermediate states of this process partial products, and argue that what a feature model really defines is a poset of its partial products. We argue that such structures can be viewed as special Kripke structure that we call partial product Kripke structures, ppKS. To specify these Kripke structures, we propose a CTL-based logic, called partial product CTL, ppCTL. We show how to represent a feature model M by a ppCTL theory ML(M ) (ML stands for modal logic) such that any ppKS satisfying the theory is equal to the partial product line determined by M . Hence, ML(M ) can be considered a sound and complete representation of M . We also discuss several applications of the modal logic view in feature modeling, including refactoring of feature models.

show abstract

Section: Modal Logic Theory Of Feature Modelsmentioning

confidence: 99%

Section: Feature Model Refactoringmentioning

confidence: 99%

See 1 more Smart Citation

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic

Diskin¹,

Safilian²,

Maibaum³

et al. 2016

SACS

View full text Add to dashboard Cite

show abstract

“…For most of the properties, the oracle can be automated and post-conditions of the merge operator be evaluated. The algorithm presented in [16] allows us to reason on the relationship between input FMs and the output FM in terms of sets of configurations. We make use of the tree edit distance metric [24], a common similarity measure for rooted ordered trees, to evaluate the hierarchy respect of the output FMs.…”

Section: Comparison Set Upmentioning

confidence: 99%

“…In [16], an algorithm is designed to automatically determine the kind of relations between two FMs in terms of sets of configuration. In [17], the case of synchronizing existing configurations of a FM that have evolved over time (e.g., some features are added) is considered and can be seen as a merge.…”

Section: Related Workmentioning

confidence: 99%

Comparing Approaches to Implement Feature Model Composition

Acher

Collet

Lahire

et al. 2010

Modelling Foundations and Applications

View full text Add to dashboard Cite

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 implementation approaches. The study provides some evidence that using generic model composition frameworks are not helping much in the realization, whereas a specific solution is finally necessary and clearly stands out by its qualities.

show abstract

Evolution in dynamic software product lines

Quinton

Vierhauser

Rabiser

et al. 2020

J Software Evolu Process

View full text Add to dashboard Cite

Many software systems today provide support for adaptation and reconfiguration at runtime, in response to changes in their environment. Such adaptive systems are designed to run continuously and may not be shut down for reconfiguration or maintenance tasks. The variability of such systems has to be explicitly managed, together with mechanisms that control their runtime adaptation and reconfiguration. Dynamic software product lines (DSPLs) can help to achieve this. However, dealing with evolution is particularly challenging in a DSPL, as changes made at runtime can easily lead to inconsistencies. This paper describes the challenges of evolving DSPLs using an example cyber-physical system for home automation. We discuss the shortcomings of existing work and present a reference architecture to support DSPL evolution. To demonstrate its feasibility and flexibility, we implemented the proposed reference architecture for two different DSPLs: the aforementioned cyber-physical system, which uses feature models to describe its variability, and a runtime monitoring infrastructure, which is based on decision models. To assess the industrial applicability of our approach, we also implemented the reference architecture for a real-world DSPL, an automation software system for injection molding machines. Our results provide evidence on the flexibility, performance and industrial applicability of our approach.

show abstract

Reasoning about edits to feature models

Cited by 243 publications

References 37 publications

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic

Comparing Approaches to Implement Feature Model Composition

Evolution in dynamic software product lines

Contact Info

Product

Resources

About