Covering arrays with mixed alphabet sizes

Journal of Combinatorial Designs

Volumn 11, Issue 6, 2003, Pages 413-432

  Moura, Lucia ^a   Stardom, John ^b   Stevens, Brett ^c   Williams, Alan ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

^b RH Coats Building ^*  (Canada)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

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

Indexed keywords

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

References (31)

1. T. Beth, D. Jungnickel, and H. Lenz, Design Theory, Volume 1, Cambridge University Press, Cambridge, 2nd edition, 1999.
2. T. Beth, D. Jungnickel, and H. Lenz, Design Theory, Volume 2, Cambridge University Press, Cambridge, 2nd edition, 1999.
3. R. K. Brayton, D. Coppersmith, and A. J. Hoffman, Self-orthogonal Latin squares of all orders n 6= 2, 3, 6, Bull Amer Math Soc 80 (1974), 116-118.
4. L. Burgess, D. L. Kreher, and D. J. Street, Small orthogonal main effect plans with four factors, Comm Statist Theory Methods, 28(10) (1999), 2441-2464.
5. M. A. Chateauneuf, C. J. Colbourn, and D. L. Kreher, Covering arrays of strength three, Des Codes Cryptogr 16(3) (1999), 235-242.
6. M. A. Chateauneuf and D. L. Kreher, On the state of strength-three covering arrays, J Combin Des 10(4) (2002), 217-238.
7. 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 Software Eng 23 (1997), 437-444.
8. D. M. Cohen, S. R. Dalal, J. Parelius, and G. C. Patton, The combinatorial design approach to automatic test generation, IEEE Software 13(5) (1996), 83-88.
9. C. J. Colbourn and J. H. Dinitz, editors, The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, 1996.
10. C. J. Colbourn and J. H. Dinitz, Making the MOLS Table, Mathematics and its Applications, Volume 368, Kluwer Academic Publishers, Dordrecht, 1996, pp. 67-135.
11. S. R. Dalal and C. L. Mallows, Factor-covering designs for testing software, Technometrics 40(3) (1998), 234-243.
12. L. Gargano, J. Körner, and U. Vaccaro, Qualitative independence and Sperner problems for directed graphs, J Combin Theory Ser A 61 (1992), 173-192.
13. L. Gargano, J. Körner, and U. Vaccaro, Sperner capacities, Graphs Combin 9 (1993), 31-46.
14. L. Gargano, J. Körner, and U. Vaccaro, Capacities: From information theory to extremal set theory, J Combin Theory Ser A 68 (1994), 296-316.
15. A. S. Hedayat, N. J. A. Sloane, and J. Stufken, Orthogonal arrays, Springer Series in Statistics, Springer-Verlag, New York, 1999, Theory and applications, With a foreword by C. R. Rao.
16. G. O. H. Katona, Two applications (for search theory and truth functions) of Sperner type theorems, Period Math Hungar 3 (1973), 19-26.
17. D. J. Kleitman and J. Spencer, Families of k-independent sets, Discrete Math 6 (1973), 255-262.
18. J. Körner and M. Lucertini, Compressing inconsistent data, IEEE Trans Inform Theory 40(3) (1994), 706-715.
19. K. Meagher and B. Stevens, Covering arrays on graphs, J Combin Theory Ser B, submited.
20. S. Poljak, A. Pultr, and V. Ró́dl, On qualitatively independent partitions and related problems, Disc Appl Math 6 (1983), 193-205.
21. S. Poljak and Z. Tuza, On the maximum number of qualitatively independent partitions, J Combin Theory Ser A 51(1989), 111-116.
22. N. J. A. Sloane, Covering arrays and intersecting codes, J Combin Des 1(1993), 51-63.
23. E. Sperner, Ein Satzüber Untermengen einer endlichen Menge, Math Z 27 (1928), 544-548.
24. J. Stardom, Metaheuristics and the Search for Covering and Packing Arrays, MSc thesis, Simon Fraser University, Burnaby, 2001.
25. B. Stevens, A. Ling, and E. Mendelsohn, A direct construction of transversal covers using group divisible designs, Ars Combin 63 (2002), 145-159.
26. B. Stevens and E. Mendelsohn, Efficient software testing protocols, Proc CASCON '98 (1998), 279-293.
27. B. Stevens and E. Mendelsohn, New recursive methods for transversal covers, J Combin Des 7(3) (1999), 185-203.
28. Brett Stevens, Lucia Moura, and Eric Mendelsohn, Lower bounds for transversal covers, Des Codes Cryptogr 15(3) (1998), 279-299.
29. A. W. Williams, Determination of test configurations for pair-wise interaction coverage, In Proceedings of the 13th International Conference on the Testing of Communicating Systems (TestCom 2000) (2000), 59-74.
30. A. W. Williams, Software Component Interaction Testing: Coverage Measurement and Generation of Configurations, PhD thesis, University of Ottawa, 2002.
31. 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, N.Y., (1996), pp. 246-254.