Model checking software product lines with SNIP |
| |
Authors: | Andreas Classen Maxime Cordy Patrick Heymans Axel Legay Pierre-Yves Schobbens |
| |
Affiliation: | 1. University of Namur, Namur, Belgium 4. INRIA Lille-Nord Europe, Université Lille 1, LIFL, CNRS, Lille, France 2. IRISA/INRIA Rennes, Rennes, France 3. University of Liège, Liège, Belgium
|
| |
Abstract: | We present SNIP, an efficient model checker for software product lines (SPLs). Variability in software product lines is generally expressed in terms of features, and the number of potential products is exponential in the number of features. Whereas classical model checkers are only capable of checking properties against each individual product in the product line, SNIP exploits specifically designed algorithms to check all products in a single step. This is done by using a concise mathematical structure for product line behaviour, that exploits similarities and represents the behaviour of all products in a compact manner. Specification of an SPL in SNIP relies on the combination of two specification languages: TVL to describe the variability in the product line, and fPromela to describe the behaviour of the individual products. SNIP is thus one of the first tools equipped with specification languages to formally express both the variability and the behaviours of the products of the product line. The paper assesses SNIP and suggests that this is the first model checker for SPLs that can be used outside the academic arena. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|