NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
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]
Kuhn, D.
, Bryce, R.
, Duan, F.
, Ghandehari, L.
, Lei, Y.
and Kacker, R.
(2015),
Combinatorial Testing: Theory and Practice, Advances in Computers, Elsevier, Amsterdam, -1, [online], https://doi.org/10.1016/bs.adcom.2015.05.003
(Accessed October 1, 2025)