Take a sneak peek at the new NIST.gov and let us know what you think!
(Please note: some content may not be complete on the beta site.).
NIST Authors in Bold
|Author(s):||David R. Kuhn; Raghu N. Kacker; Yu Lei;|
|Published:||June 25, 2012|
|Abstract:||Combinatorial testing is a method that can reduce cost and improve test effectiveness significantly for many applications. The key insight underlying this form of testing is that not every parameter contributes to every failure, and empirical data suggest that nearly all software failures are caused by interactions between relatively few parameters. This finding has important implications for testing because it suggests that testing combinations of parameters can provide highly effective fault detection. This article introduces combinatorial testing and how it evolved from statistical Design of Experiments approaches,explains its mathematical basis, where this approach can be used in software testing, and measurements of combinatorial coverage for existing test data.|
|Citation:||Encyclopedia of Software Engineering|
|Keywords:||combinatorial testing, covering arrays, design of experiments, pairwise testing, pseudoexhaustive testing, software assurance, software testing, verification|
|Research Areas:||Conformance Testing, Information Technology, Computer Security|
|PDF version:||Click here to retrieve PDF version of paper (326KB)|