CA?(N;t,k,v), is an N x k array. In every N x t subarray, each t-tuple occurs at least ? times. In combinatorial testing, t is the strength of the coverage of interactions, k is the number of components (degree), and v is the number of symbols for each component.
Published in Chapter:
Combinatorial Testing
Renée C. Bryce (Utah State University, USA), Yu Lei (University of Texas, Arlington, USA), D. Richard Kuhn (National Institute of Standards and Technology, USA), and Raghu Kacker (National Institute of Standards and Technology, USA)
Copyright: © 2010
|Pages: 13
DOI: 10.4018/978-1-60566-731-7.ch014
Abstract
Software systems today are complex and have many possible configurations. Products released with inadequate testing can cause bodily harm, result in large economic losses or security breaches, and affect the quality of day-to-day life. Software testers have limited time and budgets, frequently making it impossible to exhaustively test software. Testers often intuitively test for defects that they anticipate while less foreseen defects are overlooked. Combinatorial testing can complement their tests by systematically covering t-way interactions. Research in combinatorial testing includes two major areas (1) algorithms that generate combinatorial test suites and (2) applications of combinatorial testing. The authors review these two topics in this chapter.