Projets par an
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.
|titre||Proceedings - International Conference on Software Engineering|
|Nombre de pages||10|
|Etat de la publication||Publié - 30 oct. 2013|
|Evénement||35th International Conference on Software Engineering (ICSE 2013) - San Francisco, États-Unis|
Durée: 18 mai 2013 → 26 mai 2013
|Une conférence||35th International Conference on Software Engineering (ICSE 2013)|
|La ville||San Francisco|
|période||18/05/13 → 26/05/13|
Empreinte digitaleExaminer les sujets de recherche de « Beyond Boolean product-line model checking: Dealing with feature attributes and multi-features ». Ensemble, ils forment une empreinte digitale unique.
- 1 Terminé
1/10/11 → 30/09/15
Projet: Projet de thèse