Open AccessProceedings Article
Fama: Tooling a Framework for the Automated Analysis of Feature Models
David Benavides,Sergio Segura,Pablo Trinidad,Antonio Ruiz Cortés +3 more
- pp 129-134
Reads0
Chats0
TLDR
A first implementation of FAMA (FeAture Model Analyser), a framework for the automated analysis of feature models integrating some of the most commonly used logic representations and solvers proposed in the literature, is presented.Abstract:
The automated analysis of feature models is recognized as one of the key challenges for automated software development in the context of Software Product Lines (SPL). However, after years of research only a few ad-hoc proposals have been presented in such area and the tool support demanded by the SPL community is still insufficient. In previous work we showed how the selection of a logic representation and a solver to handle analysis on feature models can have a remarkable impact in the performance of the analysis process. In this paper we present a first implementation of FAMA (FeAture Model Analyser). FAMA is a framework for the automated analysis of feature models integrating some of the most commonly used logic representations and solvers proposed in the literature. To the best of our knowledge, FAMA is the first tool integrating different solvers for the automated analyses of feature models.read more
Citations
More filters
Journal ArticleDOI
Automated analysis of feature models 20 years later: A literature review
TL;DR: This paper provides a comprehensive literature review on the automated analysis of feature models 20 years after of their invention and presents a conceptual framework to understand the different proposals as well as categorise future contributions.
Journal ArticleDOI
FeatureIDE: An extensible framework for feature-oriented software development
TL;DR: All phases of FOSD are supported in FeatureIDE, namely domain analysis, requirements analysis, domain implementation, and software generation.
Proceedings ArticleDOI
SAT-based analysis of feature models is easy
TL;DR: Unlike with the general SAT instances, which fall into easy and hard classes, the instances induced by feature modeling are easy throughout the spectrum of realistic models.
Proceedings ArticleDOI
Automated and Scalable T-wise Test Case Generation Strategies for Software Product Lines
TL;DR: This work proposes a scalable toolset using Alloy to automatically generate test cases satisfying T-wise from SPL models, and defines strategies to split T- wise combinations into solvable subsets.
Journal ArticleDOI
A text-based approach to feature modelling: Syntax and semantics of TVL
TL;DR: TVL was designed, a text-based feature modelling language to provide engineers with a human-readable language with a rich syntax to make modelling easy and models natural, but also with a formal semantics to avoid ambiguity and allow powerful automation.
References
More filters
Journal ArticleDOI
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
Proceedings ArticleDOI
The complexity of theorem-proving procedures
TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
Book
Foundations of Constraint Satisfaction
TL;DR: Introduction to the C SP CSP solving - an overview chapter fundamental concepts of the CSP chapter problem reduction chapter basic search strategies for solving CSPs search orders in searching in C SPs exploitation of problem specific features stochastic search methods.
Book ChapterDOI
Feature models, grammars, and propositional formulas
TL;DR: This work integrates prior results to connect feature models, grammars, and propositional formulas, which allows arbitrary propositional constraints to be defined among features and enables off-the-shelf satisfiability solvers to debug feature models.
Journal ArticleDOI
Scaling step-wise refinement
TL;DR: The AHEAD (algebraic hierarchical equations for application design) model is presented, that shows how step-wise refinement scales to synthesize multiple programs and multiple noncode representations, and a tool set that supports AHEAD is reviewed.