Generative programming: methods, tools, and applications
Generative programming: methods, tools, and applications
Alloy: a lightweight object modelling notation
ACM Transactions on Software Engineering and Methodology (TOSEM)
FORM: A feature-oriented reuse method with domain-specific reference architectures
Annals of Software Engineering
Using First-Order Logic for Product Line Model Validation
SPLC 2 Proceedings of the Second International Conference on Software Product Lines
Formal Semantics and Verification for Feature Modeling
ICECCS '05 Proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems
Reasoning about Feature Models in Higher-Order Logic
SPLC '07 Proceedings of the 11th International Software Product Line Conference
SPLC '08 Proceedings of the 2008 12th International Software Product Line Conference
Automated analysis of feature models 20 years later: A literature review
Information Systems
Automated reasoning on feature models
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
Mapping features to models: a template approach based on superimposed variants
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
Feature models, grammars, and propositional formulas
SPLC'05 Proceedings of the 9th international conference on Software Product Lines
A unified tabular method for modeling variants of software product line
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
Formal verification of variant requirements has gained much interest in the software product line (SPL) community. Feature diagrams are widely used to model product line variants. However, there is a lack of precisely defined formal notation for representing and verifying such models. This paper presents an approach to modeling and analyzing SPL variant feature diagrams using first-order logic. It provides a precise and rigorous formal interpretation of the feature diagrams. Logical expressions can be built by modeling variants and their dependencies by using propositional connectives. These expressions can then be validated by any suitable verification tool such as Alloy. A case study of a Computer Aided Dispatch (CAD) system variant feature model is presented to illustrate the analysis and verification process.