Combinatorial aspects of covering arrays
Covering arrays generalize orthogonal arrays by requiring that <em>t</em> -tuples be covered, but not requiring that the appearance of <em>t</em> -tuples be balanced.<br />Their uses in screening experiments has found application in software testing, hardware testing, a...
Main Author: | Charles J. Colbourn |
---|---|
Format: | Article |
Language: | English |
Published: |
Università degli Studi di Catania
2004-11-01
|
Series: | Le Matematiche |
Subjects: | |
Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/166 |
Similar Items
-
A recursive construction for perfect hash families
by: Colbourn Charles J., et al.
Published: (2009-12-01) -
Metaheuristic algorithm for the construction of mixed covering arrays of different strength levels to be used in the design of black box software test cases
by: Andrés Rodrigo López Realpe, et al.
Published: (2022-11-01) -
Methods to Construct Uniform Covering Arrays
by: Jose Torres-Jimenez, et al.
Published: (2019-01-01) -
Accelerating covering array generation by combinatorial join for industry scale software testing
by: Hiroshi Ukai, et al.
Published: (2022-02-01) -
MVSCA: Multi-Valued Sequence Covering Array
by: Mohamed Issam Younis
Published: (2019-10-01)