Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Feature integration using a feature construct
Science of Computer Programming
Software Product Line Engineering: Foundations, Principles and Techniques
Software Product Line Engineering: Foundations, Principles and Techniques
Feature Diagrams: A Survey and a Formal Semantics
RE '06 Proceedings of the 14th IEEE International Requirements Engineering Conference
Granularity in software product lines
Proceedings of the 30th international conference on Software engineering
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
A BDD-Based Approach to Verifying Clone-Enabled Feature Models' Constraints and Customization
ICSR '08 Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems
Modeling and Model Checking Software Product Lines
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
Tag and prune: a pragmatic approach to software product line implementation
Proceedings of the IEEE/ACM international conference on Automated software engineering
A formal semantics for feature cardinalities in feature diagrams
Proceedings of the 5th Workshop on Variability Modeling of Software-Intensive Systems
Evaluating a textual feature modelling language: four industrial case studies
SLE'10 Proceedings of the Third international conference on Software language engineering
Symbolic model checking of software product lines
Proceedings of the 33rd International Conference on Software Engineering
A text-based approach to feature modelling: Syntax and semantics of TVL
Science of Computer Programming
Formal Description of Variability in Product Families
SPLC '11 Proceedings of the 2011 15th International Software Product Line Conference
SLE'09 Proceedings of the Second international conference on Software Language Engineering
MCMT: a model checker modulo theories
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Detection of feature interactions using feature-aware verification
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Simulation-based abstractions for software product-line model checking
Proceedings of the 34th International Conference on Software Engineering
Behavioural modelling and verification of real-time software product lines
Proceedings of the 16th International Software Product Line Conference - Volume 1
ProVeLines: a product line of verifiers for software product lines
Proceedings of the 17th International Software Product Line Conference co-located workshops
Comparing or configuring products: are we getting the right ones?
Proceedings of the Eighth International Workshop on Variability Modelling of Software-Intensive Systems
Scenario-based verification in presence of variability using a synchronous approach
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Model checking techniques for software product lines (SPL) are actively researched. A major limitation they currently have is the inability to deal efficiently with non-Boolean features and multi-features. An example of a non-Boolean feature is a numeric attribute such as maximum number of users which can take different numeric values across the range of SPL products. Multi-features are features that can appear several times in the same product, such as processing units which number is variable from one product to another and which can be configured independently. Both constructs are extensively used in practice but currently not supported by existing SPL model checking techniques. To overcome this limitation, we formally define a language that integrates these constructs with SPL behavioural specifications. We generalize SPL model checking algorithms correspondingly and evaluate their applicability. Our results show that the algorithms remain efficient despite the generalization.