A survey of binary covering arrays
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Binary covering arrays of strength $t$ are 0–1 matrices having the property that for each $t$ columns and each of the possible $2^t$ sequences of $t$ 0's and 1's, there exists a row having that sequence in that set of $t$ columns. Covering arrays are an important tool in certain applications, for example, in software testing. In these applications, the number of columns of the matrix is dictated by the application, and it is desirable to have a covering array with a small number of rows. Here we survey some of what is known about the existence of binary covering arrays and methods of producing them, including both explicit constructions and search techniques.
DOI : 10.37236/571
Classification : 05B20, 05B30
Mots-clés : software testing, search techniques
@article{10_37236_571,
     author = {Jim Lawrence and Raghu N. Kacker and Yu Lei and D. Richard Kuhn and Michael Forbes},
     title = {A survey of binary covering arrays},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/571},
     zbl = {1298.05048},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/571/}
}
TY  - JOUR
AU  - Jim Lawrence
AU  - Raghu N. Kacker
AU  - Yu Lei
AU  - D. Richard Kuhn
AU  - Michael Forbes
TI  - A survey of binary covering arrays
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/571/
DO  - 10.37236/571
ID  - 10_37236_571
ER  - 
%0 Journal Article
%A Jim Lawrence
%A Raghu N. Kacker
%A Yu Lei
%A D. Richard Kuhn
%A Michael Forbes
%T A survey of binary covering arrays
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/571/
%R 10.37236/571
%F 10_37236_571
Jim Lawrence; Raghu N. Kacker; Yu Lei; D. Richard Kuhn; Michael Forbes. A survey of binary covering arrays. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/571

Cité par Sources :