A survey of methods for constructing covering arrays

Autor: Victor V. Kuliamin, A. A. Petukhov
Rok vydání: 2011
Předmět:
Zdroj: Programming and Computer Software. 37:121-146
ISSN: 1608-3261
0361-7688
DOI: 10.1134/s0361768811030029
Popis: The paper presents a survey of methods for constructing covering arrays used in generation of tests for interfaces with a great number of parameters. The application domain of these methods and algorithms used in them are analyzed. Specific characteristics of the methods, including time complexity and estimates of the required memory, are presented. Various--direct, recursive, optimization, genetic, and backtracking--algorithms used for constructing covering arrays are presented. Heuristics are presented that allow one to reduce arrays without loss of completeness, and application domains of these heuristics are outlined.
Databáze: OpenAIRE
Externí odkaz: