Pairwise Testing for Software Product Lines: Comparison of Two Approaches

Abstract : Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability, which in turn leads to combinatorial explosion of the number of derivable products. Exhaustive testing in such a large products space is hardly feasible. Hence, one possible option is to test SPLs by generating test configurations that cover all possible t feature interactions (t-wise). It dramatically reduces the number of test products while ensuring reasonable SPL coverage. In this paper, we report our experience on applying t-wise techniques for SPL with two independent toolsets developed by the authors. One focuses on generality and splits the generation problem according to strategies. The other emphasizes providing efficient generation. To evaluate the respective merits of the approaches, measures such as the number of generated test configurations and the similarity between them are provided. By applying these measures we were able to derive useful insights for pairwise and t-wise testing of product lines.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-00805856
Contributor : Benoit Baudry <>
Submitted on : Friday, March 29, 2013 - 9:57:17 AM
Last modification on : Friday, November 16, 2018 - 1:27:48 AM
Long-term archiving on : Sunday, June 30, 2013 - 4:00:27 AM

File

ICST-SPLC-SQJ2010-Ext.pdf
Files produced by the author(s)

Identifiers

Citation

Gilles Perrouin, Sabastian Oster, Sagar Sen, Jacques Klein, Benoit Baudry, et al.. Pairwise Testing for Software Product Lines: Comparison of Two Approaches. Software Quality Journal, Springer Verlag, 2012, 20 (3-4), pp.605-643. ⟨10.1007/s11219-011-9160-9⟩. ⟨hal-00805856⟩

Share

Metrics

Record views

990

Files downloads

1077