Software product lines: practices and patterns
Software product lines: practices and patterns
Using First-Order Logic for Product Line Model Validation
SPLC 2 Proceedings of the Second International Conference on Software Product Lines
Software Product Line Engineering: Foundations, Principles and Techniques
Software Product Line Engineering: Foundations, Principles and Techniques
Constraint Logic Programming using Eclipse
Constraint Logic Programming using Eclipse
A UML 2 Profile for Variability Models and their Dependency to Business Processes
DEXA '07 Proceedings of the 18th International Conference on Database and Expert Systems Applications
Deriving Product Line Requirements: the RED-PL Guidance Approach
APSEC '07 Proceedings of the 14th Asia-Pacific Software Engineering Conference
Automated error analysis for the agilization of feature modeling
Journal of Systems and Software
A Generic Approach for Automatic Model Composition
Models in Software Engineering
Automated Diagnosis of Product-Line Configuration Errors in Feature Models
SPLC '08 Proceedings of the 2008 12th International Software Product Line Conference
Automated Merging of Feature Models Using Graph Transformations
Generative and Transformational Techniques in Software Engineering II
Automated reasoning for multi-step feature model configuration problems
Proceedings of the 13th International Software Product Line Conference
SAT-based analysis of feature models is easy
Proceedings of the 13th International Software Product Line Conference
RED-PL, a method for deriving product requirements from a product line requirements model
CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
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
Using Integer Constraint Solving in Reuse Based Requirements Engineering
RE '10 Proceedings of the 2010 18th IEEE International Requirements Engineering Conference
Using constraint programming to verify DOPLER variability models
Proceedings of the 5th Workshop on Variability Modeling of Software-Intensive Systems
A text-based approach to feature modelling: Syntax and semantics of TVL
Science of Computer Programming
Feature models, grammars, and propositional formulas
SPLC'05 Proceedings of the 9th international conference on Software Product Lines
Using java CSP solvers in the automated analyses of feature models
GTTSE'05 Proceedings of the 2005 international conference on Generative and Transformational Techniques in Software Engineering
Exploration of the capabilities of constraint programming for software verification
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Proceedings of the 17th International Software Product Line Conference
An Ontological Rule-Based Approach for Analyzing Dead and False Optional Features in Feature Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Drawing from an analogy between features based Product Line PL models and Constraint Programming CP, this paper explores the use of CP in the Domain Engineering and Application Engineering activities that are put in motion in a Product Line Engineering strategy. Specifying a PL as a constraint program instead of a feature model carries out two important qualities of CP: expressiveness and direct automation. On the one hand, variables in CP can take values over boolean, integer, real or even complex domains and not only boolean values as in most PL languages such as the Feature-Oriented Domain Analysis FODA. Specifying boolean, arithmetic, symbolic and reified constraint, provides a power of expression that spans beyond that provided by the boolean dependencies in FODA models. On the other hand, PL models expressed as constraint programs can directly be executed and analyzed by off-the-shelf solvers. This paper explores the issues of a how to specify a PL model using CP, including in the presence of multi-model representation, b how to verify PL specifications, c how to specify configuration requirements, and d how to support the product configuration activity. Tests performed on a benchmark of 50 PL models show that the approach is efficient and scales up easily to very large and complex PL specifications.