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 September 15, 2024)
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.
Combinatorial Testing: Theory and Practice
Published
Author(s)
, Renee Bryce, Feng Duan, Laleh Ghandehari, Yu Lei,
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
Download Paper
Keywords
algorithms, combinatorial testing, constraints, covering array, fault localization, interaction testing, sequence testing, software faults, software testing, test suite prioritization
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created August 18, 2015, Updated November 10, 2018