Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
Experimentation in software engineering: an introduction
Experimentation in software engineering: an introduction
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Software Product Line Engineering: Foundations, Principles and Techniques
Software Product Line Engineering: Foundations, Principles and Techniques
Using Multivariate Statistics (5th Edition)
Using Multivariate Statistics (5th Edition)
Feature Diagrams and Logics: There and Back Again
SPLC '07 Proceedings of the 11th International Software Product Line Conference
IEEE Transactions on Computers
SPLC '08 Proceedings of the 2008 12th International Software Product Line Conference
Efficient compilation techniques for large scale feature models
GPCE '08 Proceedings of the 7th international conference on Generative programming and component engineering
Clasp: a conflict-driven answer set solver
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
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
Feature models, grammars, and propositional formulas
SPLC'05 Proceedings of the 9th international conference on Software Product Lines
A Survey of Automated Techniques for Formal Software Verification
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Comparing the effectiveness of reasoning formalisms for partial models
Proceedings of the Workshop on Model-Driven Engineering, Verification and Validation
FAMILIAR: A domain-specific language for large scale management of feature models
Science of Computer Programming
Defining variability in activity diagrams and Petri nets
Science of Computer Programming
Automated generation of computationally hard feature models using evolutionary algorithms
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The formalization of variability models (e.g. feature models) is a prerequisite for the automated analysis of these models. The efficient execution of the analysis operations depends on the selection of well-suited solver implementations. Regarding feature models, on the one hand, the formalization with Boolean expressions enables the use of SAT or BDD solvers. On the other hand, feature models can be transformed into a Constraint-Satisfaction Problem (CSP) in order to use CSP solvers for validation. This paper presents a performance comparison regarding nine contemporary high-performance solvers, three for each base problem structure (BDD, CSP, and SAT). Four operations on 90 feature models are run on each solver. The results will in turn clear the way for new improvements regarding the automatic verification of software product lines, since the efficient execution of analysis operations is essential to such automatic verification approaches.