Strength two covering arrays: Existence tables and projection

Discrete Mathematics

Volumn 308, Issue 5-6, 2008, Pages 772-786

  Colbourn, Charles J ^a  

^a Arizona State University   (United States)

Author keywords

Covering array; Orthogonal array

Indexed keywords

COMPUTATIONAL GEOMETRY; FINITE DIFFERENCE METHOD; MATHEMATICAL MORPHOLOGY; NUMERICAL METHODS; PROBLEM SOLVING;

COVERING ARRAYS; ORTHOGONAL ARRAYS; RECURSIVE CONSTRUCTIONS; SYMBOLS;

COMBINATORIAL MATHEMATICS;

EID: 38049115622     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.07.050     Document Type: Article

References (18)

1. Bryce R.C., Colbourn C.J., and Cohen M.B. A framework of greedy methods for constructing interaction test suites. Proceedings of the 27th International Conference on Software Engineering (ICSE2005). St. Louis, MO (May 2005) 146-155
2. Chateauneuf M.A., and Kreher D.L. On the state of strength-three covering arrays. J. Combin. Design 10 (2002) 217-238
3. M.B. Cohen, Designing test suites for software interaction testing, Ph.D. Thesis, University of Auckland, 2004, and private communications, 2005.
4. Cohen D.M., Dalal S.R., Fredman M.L., and Patton G.C. The AETG system: an approach to testing based on combinatorial design. IEEE Trans. Software Eng. 23 (1997) 437-444
5. Colbourn C.J. Combinatorial aspects of covering arrays. Matematiche (Catania) 58 (2004) 121-167
6. C.J. Colbourn, J.H. Dinitz (Eds.), The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, 1996.
7. Colbourn C.J., Martirosyan S.S., Mullen G.L., Shasha D., Sherwood G.B., and Yucas J.L. Products of mixed covering arrays of strength two. J. Combin. Design 14 (2006) 124-138
8. Godbole A.P., Skipper D.E., and Sunley R.A. t-Covering arrays: upper bounds and Poisson approximations. Combin. Probab. Comput. 5 (1996) 105-118
9. Hartman A. Software and hardware testing using combinatorial covering suites. In: Golumbic M.C., and Hartman I.B.-A. (Eds). Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms (2006), Springer, Norwell MA 237-266
10. Hartman A., and Raskin L. Problems and algorithms for covering arrays. Discrete Math. 284 (2004) 149-156
11. Hedayat A.S., Sloane N.J.A., and Stufken J. Orthogonal Arrays, Theory and Applications (1999), Springer, Berlin
12. Hnich B., Prestwich S., and Selensky E. Constraint-Based Approaches to the Covering Test Problem, Lecture Notes in Computer Science vol. 3419 (2005), Springer, Berlin pp. 172-186
13. K. Meagher, Covering arrays on graphs: qualitative independence graphs and extremal set partition theory, Ph.D. Thesis, University of Ottawa, Canada, 2005.
14. Meagher K., and Stevens B. Group construction of covering arrays. J. Combin. Design 13 (2005) 70-77
15. Nurmela K. Upper bounds for covering arrays by tabu search. Discrete Appl. Math. 138 (2004) 143-152
16. Sloane N.J.A. Covering arrays and intersecting codes. J. Combin. Design 1 (1993) 51-63
17. B. Stevens, Transversal covers and packings, Ph.D. Thesis, Mathematics, University of Toronto, 1998.
18. Stevens B., Ling A.C.H., and Mendelsohn E. A direct construction of transversal covers using group divisible designs. Ars Combin. 63 (2002) 145-159