Set-Based Algorithms for Combinatorial Test Set Generation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Set-Based Algorithms for Combinatorial Test Set Generation

Ludwig Kampel
  • Function : Author
  • PersonId : 1023397
Dimitris E. Simos
  • Function : Author


Testing is an important and expensive part of software and hardware development. Over the recent years, the construction of combinatorial interaction tests rose to play an important role towards making the cost of testing more efficient. Covering arrays are the key element of combinatorial interaction testing and a means to provide abstract test sets. In this paper, we present a family of set-based algorithms for generating covering arrays and thus combinatorial test sets. Our algorithms build upon an existing mathematical method for constructing independent families of sets, which we extend sufficiently in terms of algorithmic design in this paper. We compare our algorithms against commonly used greedy methods for producing 3-way combinatorial test sets, and these initial evaluation results favor our approach in terms of generating smaller test sets.
Fichier principal
Vignette du fichier
419911_1_En_16_Chapter.pdf (324.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01643730 , version 1 (21-11-2017)





Ludwig Kampel, Dimitris E. Simos. Set-Based Algorithms for Combinatorial Test Set Generation. 28th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2016, Graz, Austria. pp.231-240, ⟨10.1007/978-3-319-47443-4_16⟩. ⟨hal-01643730⟩
33 View
90 Download



Gmail Facebook X LinkedIn More