A systematic approach to derive the scope of software product lines
Proceedings of the 21st international conference on Software engineering
Generative programming: methods, tools, and applications
Generative programming: methods, tools, and applications
FORM: A feature-oriented reuse method with domain-specific reference architectures
Annals of Software Engineering
Variability management with feature models
Science of Computer Programming - Special issue: Software variability management
Modelling Requirements Variability across Product Lines
RE '05 Proceedings of the 13th IEEE International Conference on Requirements Engineering
Tracing software product line variability: from problem to solution space
SAICSIT '05 Proceedings of the 2005 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Verifying feature-based model templates against well-formedness OCL constraints
Proceedings of the 5th international conference on Generative programming and component engineering
ICCSA '07 Proceedings of the The 2007 International Conference Computational Science and its Applications
S.P.L.O.T.: software product lines online tools
Proceedings of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications
Automated analysis of feature models 20 years later: A literature review
Information Systems
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
The seventh QBF solvers evaluation (QBFEVAL’10)
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
A theory of software product line refinement
Theoretical Computer Science
| Hi-index | 0.00 |
In a Software Product Line (SPL), the central notion of implementability provides the requisite connection between specifications (feature sets) and their implementations (component sets), leading to the definition of products. While it appears to be a simple extension (to sets) of the trace-ability relation between components and features, it actually involves several subtle issues which are overlooked in the definitions in existing literature. In this paper, we give a precise and formal definition of implementability over a fairly expressive traceability relation to solve these issues. The consequent definition of products in the given SPL naturally entails a set of useful analysis problems that are either refinements of known problems, or are completely novel. We also propose a new approach to solve these analysis problems by encoding them as Quantified Boolean Formula(QBF) and solving them through Quantified Satisfiability (QSAT) solvers. The methodology scales much better than the SAT-based solutions hinted in the literature and is demonstrated through a prototype tool called SPLANE (SPL Analysis Engine), on a couple of fairly large case studies.