FORM: A feature-oriented reuse method with domain-specific reference architectures
Annals of Software Engineering
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Generative Programming for Embedded Software: An Industrial Experience Report
GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
Generic semantics of feature diagrams
Computer Networks: The International Journal of Computer and Telecommunications Networking
Automated analysis of feature models 20 years later: A literature review
Information Systems
Mapping extended feature models to constraint logic programming over finite domains
SPLC'10 Proceedings of the 14th international conference on Software product lines: going beyond
Automated reasoning on feature models
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
Automated generation of computationally hard feature models using evolutionary algorithms
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Feature modeling has been found very effective for modeling and managing variability in Software Product Lines. The nature of feature models invites, sometimes even requires, the use of global constraints. This paper lays the groundwork for the inclusion of global constraints in automated reasoning on feature models. We present a mapping from extended feature models to constraint logic programming over finite domains, and show that this mapping enables using global constraints on feature attributes, as well as features, for a variety of analysis operations on feature models. We also present performance test results and discuss the benefits of using global constraints.