DMCA
Sat-based analysis of feature models is easy (2009)
| Venue: | In 13th International Conference on Software Product Lines (SPLC 2009 |
| Citations: | 65 - 11 self |
BibTeX
@INPROCEEDINGS{Mendonca09sat-basedanalysis,
author = {Marcilio Mendonca and Krzysztof Czarnecki and Andrzej W ˛asowski},
title = {Sat-based analysis of feature models is easy},
booktitle = {In 13th International Conference on Software Product Lines (SPLC 2009},
year = {2009}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Feature models are a popular variability modeling notation used in product line engineering. Automated analyses of feature models, such as consistency checking and interactive or offline product selection, often rely on translating models to propositional logic and using satisfiability (SAT) solvers. Efficiency of individual satisfiability-based analyses has been reported previously. We generalize and quantify these studies with a series of independent experiments. We show that previously reported efficiency is not incidental. Unlike with the general SAT instances, which fall into easy and hard classes, the instances induced by feature modeling are easy throughout the spectrum of realistic models. In particular, the phenomenon of phase transition is not observed for realistic feature models. Our main practical conclusion is a general encouragement for researchers to continued development of SATbased methods to further exploit this efficiency in future. 1
Keyphrases
feature model sat-based analysis product line engineering popular variability automated analysis phase transition satbased method realistic model hard class realistic feature model individual satisfiability-based analysis consistency checking general sat instance offline product selection independent experiment main practical conclusion feature modeling general encouragement propositional logic
