Combinatorial Testing: Theory and Practice

Published: August 18, 2015

Author(s)

David R. Kuhn, Renee Bryce, Feng Duan, Laleh Ghandehari, Yu Lei, Raghu N. Kacker

Abstract

Combinatorial testing has rapidly gained favor among software testers in the past decade as improved algorithms have become available, and practical success has been demonstrated. This article reviews the theory and application of this method, focusing particularly on research since 2010, with a brief background providing the rationale and development of combinatorial methods for software testing. Significant advances have occurred in algorithm performance, and the critical area of constraint representation and processing. In addition to these foundational topics, we take a look at advances in specialized areas including test suite prioritization, sequence testing, fault localization, the relationship between combinatorial testing and structural coverage, and approaches to very large testing problems. [Chapter 1 in Advances in Computers vol. 99, August 2015]
Citation: Advances in Computers
Volume: 99
Publisher Info: Elsevier, Amsterdam, -1
Pub Type: Book Chapters

Keywords

algorithms, combinatorial testing, constraints, covering array, fault localization, interaction testing, sequence testing, software faults, software testing, test suite prioritization
Created August 18, 2015, Updated November 10, 2018