Skip to Main content Skip to Navigation
Conference papers

Set-Based Algorithms for Combinatorial Test Set Generation

Abstract : 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.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, November 21, 2017 - 3:53:29 PM
Last modification on : Tuesday, November 21, 2017 - 3:55:56 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads