Practical Combinatorial Testing: Beyond Pairwise

Published: June 01, 2008


David R. Kuhn, Yu Lei, Raghu N. Kacker


With new algorithms and tools, developers can apply high-strength combinatorial testing to detect elusive failures that occur only when multiple components interact. In pairwise testing, all possible pairs of parameter values are covered by at least one test, and good tools are available to generate arrays with the value pairs. In the past few years, advances in covering-array algorithms, integrated with model checking or other testing approaches, have made it practical to extend combinatorial testing beyond pairwise tests. The US National Institute of Standards and Technology (NIST) and the University of Texas, Arlington, are now distributing freely available methods and tools for constructing large t-way combination test sets (known as covering arrays), converting covering arrays into executable tests, and automatically generating test oracles using model checking ( In this review, we focus on real-world problems and empirical results from applying these methods and tools.
Citation: IT Professional (IEEE)
Volume: 10
Issue: 3
Pub Type: Journals


all-pairs testing, assurance, combinatorial testing, debugging, faults, pairwise testing
Created June 01, 2008, Updated November 10, 2018