Set-Based Algorithms for Combinatorial Test Set Generation

Conference paper

DOI: 10.1007/978-3-319-47443-4_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9976)
Cite this paper as:
Kampel L., Simos D.E. (2016) Set-Based Algorithms for Combinatorial Test Set Generation. In: Wotawa F., Nica M., Kushik N. (eds) Testing Software and Systems. ICTSS 2016. Lecture Notes in Computer Science, vol 9976. Springer, Cham

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.

Keywords

Combinatorial testing Independent families of sets Set-based algorithms 

Copyright information

© IFIP International Federation for Information Processing 2016

Authors and Affiliations

  1. 1.SBA ResearchViennaAustria

Personalised recommendations