Abstract
We present an algorithm which eliminates constraints from a feature model whose feature diagram is a tree and whose constraints are "requires" or "excludes" constraints. The algorithm constructs a feature tree which has the same semantics as the original feature model. The computational complexity of the algorithm is exponential in the number of constraints, but linear in the number of features. The algorithm allows to efficiently compute properties of product lines whose feature model consists of a feature tree and a small number of "requires" and "excludes" constraints. An executable specification of the algorithm is given in the functional programming language Miranda.
Original language | Undefined |
---|---|
Title of host publication | Proceedings of the 12th International Software Product Line Conference |
Place of Publication | Limerick, Ireland |
Publisher | Lero International Science Centre, University of Limerick, Ireland |
Pages | 227-232 |
Number of pages | 6 |
ISBN (Print) | 978-1-905952-06-9 |
Publication status | Published - 2008 |
Event | 12th International Software Product Line Conference, SPLC 2008 - Limerick, Ireland Duration: 8 Sept 2008 → 12 Sept 2008 Conference number: 12 |
Publication series
Name | |
---|---|
Publisher | Lero International Science Centre, University of Limerick, Ireland |
Number | Supplement |
Workshop
Workshop | 12th International Software Product Line Conference, SPLC 2008 |
---|---|
Abbreviated title | SPLC |
Country/Territory | Ireland |
City | Limerick |
Period | 8/09/08 → 12/09/08 |
Keywords
- EWI-13457
- IR-64986
- METIS-251190
- SE-Q: Quality Modelling and Verification