Kuhn, D.
(2006),
An Algorithm for Generating Very Large Covering Arrays, NIST Interagency/Internal Report (NISTIR), National Institute of Standards and Technology, Gaithersburg, MD
(Accessed December 14, 2025)
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.
An Algorithm for Generating Very Large Covering Arrays
Published
Author(s)
Abstract
This note describes a covering array algorithm that can be parallelized, making it possible to handle a much larger number of variables than other know algorithms. The algorithm trades test case optimization for speed ? it produces roughly 3% to 15% more tests than other known for 10 or more variables, but this ratio improves as the number of variables increases. It thus complements but does not replace other algorithms, which produce somewhat fewer tests. A significant advantage of the algorithm is that it can be distributed across any number of processors.Citation
NIST Interagency/Internal Report (NISTIR) - 7308
Report Number
7308
NIST Pub Series
Pub Type
NIST Pubs
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact [email protected].
Created April 19, 2006, Updated January 27, 2020