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)
parameter values, while minimizing the number of tests. (simple example for pairwise testing)
array tables, by Charlie
- NIST resources on Combinatorial Testing
- 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),
- 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:
Elizabeth Maltais, Graph-dependent Covering Arrays and LYM inequalities, PhD thesis, University of Ottawa, February 2016.
- Sebastian Raaphorst, Variable strength covering arrays, PhD thesis, University of Ottawa, December 2012.
- Jacob Chodoriwsky, Error locating arrays, adaptive software testing and combinatorial group testing, MSc tthesis, University of Ottawa, June 2012.
Elizabeth Maltais, Covering arrays avoiding forbidden edges and edge clique covers, MSc thesis, University of Ottawa, October 2009.
covering arrays on graphs and
tabu search algorithm, Master's thesis, University of
Ottawa, September 2006.
arrays on graphs: qualitative
independence graphs and extremal set-partition theory,
PhD thesis, University of Ottawa, September 2005.
- Online resource search: Google search on
"covering arrays", Google
SCHOLAR search on "covering arrays"
conferences and workshops:
applications (software testing,
hardware testing, etc):