Group construction of covering arrays

Journal of Combinatorial Designs

Volumn 13, Issue 1, 2005, Pages 70-77

  Meagher, Karen ^a   Stevens, Brett ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Covering array; Factorial design; Network testing; Orthogonal array; Software testing; Transversal design

Indexed keywords

EID: 11144229028     PISSN: 10638539     EISSN: 15206610     Source Type: Journal    
DOI: 10.1002/jcd.20035     Document Type: Article

References (16)

1. M. A. Chateauneuf, C. J. Colbourn, and D. L. Kreher, Covering arrays of strength three, Des Codes Cryptogr 16(3) (1999), 235-242. (Pubitemid 129617853)
2. M. A. Chateauneuf and D. L. Kreher, On the state of strength-three covering arrays, J Combin Des 10(4) (2002), 217-238.
3. D. M. Cohen, S. R. Dalal, M. L. Fredman, and G. C. Patton, The AETG system: An approach to testing based on combinatorial design, IEEE Trans Soft Eng 23(1997), 437-444. (Pubitemid 127828305)
4. D. M. Cohen, S. R. Dalal, J. Parelius, and G. C. Patton, The combinatorial design approach to automatic test generation, IEEE Sof 13(5) (1996), 83-88.
5. S. R. Dalal and C. L. Mallows, Factor-covering designs for testing software, Technometrics 40(3) (1998), 234-243. (Pubitemid 128605632)
6. A. Hartman and L. Raskin, Problems and algorithms for covering arrays, Disc Math 284(1-3) (2004), 149-156.
7. A. S. Hedayat, N. J. A. Sloane, and J. Stufken, Orthogonal Arrays, Springer Series in Statistics, Springer-Verlag, New York, 1999.
8. G. O. H. Katona, Two applications (for search theory and truth functions) of Sperner type theorems, Period Math Hungar 3(1973), 19-26.
9. K. Nurmela, Upper bounds for covering arrays by tabu search, Discrete Appl Math 138(1-2) (2004), 143-152.
10. N. J. A. Sloane, Covering arrays and intersecting codes, J Combin Des 1(1993), 51-63.
11. J. Stardom, Metaheuristics and the Search for Covering and Packing Arrays, MSc thesis, Simon Fraser University, Burnaby, 2001.
12. B. Stevens, Transversal Covers and Packings, PhD thesis, University of Toronto, Toronto, 1998.
13. B. Stevens and E. Mendelsohn, Efficient software testing protocols, Proc CASCON'98(1998), 279-293.
14. B. Stevens and E. Mendelsohn, New recursive methods for transversal covers, J Combin Des 7(3) (1999), 185-203.
15. B. Stevens, L. Moura, and E. Mendelsohn, Lower bounds for transversal covers, Des Codes Cryptogr 3(1998), 279-299. (Pubitemid 128507653)
16. A. W. Williams and R. L. Probert, A practical strategy for testing pair-wise coverage of network interfaces, In Proceedings of the 7th International Conference on Software Reliability Engineering (ISSRE'96), White Plains, NY, 1996, pp. 246-254.