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: | |
|---|---|
| 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 |
| Summary: | 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, and a variety of fields in which interactions among factors are to be identified. Here a combinatorial view of covering arrays is adopted, encompassing basic bounds, direct constructions, recursive constructions, algorithmic methods, and applications.<br /> |
|---|---|
| ISSN: | 0373-3505 2037-5298 |