Covering arrays information by Lucia Moura
Covering arrays are combinatorial designs useful in "pairwise testing"
or "t-wise testing" of systems such as software, networks and circuits.
Since exhaustive testing is too expensive and random testing don't
necessarily comes with coverage guarantees, covering arrays provide a
nice tradeoff: detect errors coming from all t-wise (or smaller)
interactions of
parameter values, while minimizing the number of tests. (simple example for pairwise testing)
resources:
- Covering
array tables, by Charlie
Colbourn
- Survey articles:
- Charles Colbourn, Combinatorial
aspects of covering arrays, Le
Matematiche (Catania) 58 (2004), 121-167.
- Alan Hartman and Leonid Raskin, Problems
and algorithms for covering arrays, Discrete Mathematics 284(2004),
149-156.
- Charles Colbourn, "Covering arrays", in CRC handbook of
combinatorial designs, 2nd edition, Colbourn and Dinitz, eds, CRC
Press, November 2006.
- Survey talks:
- Lucia Moura's supervised theses on covering arrays:
- Online resource search: Google search on
"covering arrays", Google
SCHOLAR search on "covering arrays"
conferences and workshops:
applications (software testing,
hardware testing, etc):
