Profiles of covering arrays of strength two

Document Type : Research Paper

Authors

1 Arizona State University, P.O. Box 878809, , Tempe, AZ 85287-8809, U.S.A. and State Key Laboratory of Software Development Environment,, Beihang University, Beijing 100191, China.

2 CINVESTAV-Tamaulipas, Information Technology Laboratory,, Km. 6 Carretera Victoria-Monterrey, 87276 Victoria Tamps., Mexico

Abstract

Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques can overcome these computational difficulties, but for strength two do not appear to yield a number of tests that is competitive with the fewest known.

Keywords

Journal of Algorithms and Computation
Volume 44, Issue 1 - Serial Number 1
December 2013
Pages 31-59

Files

Share

How to cite

Statistics