Products of mixed covering arrays of strength two

Journal of Combinatorial Designs

Volumn 14, Issue 2, 2006, Pages 124-138

  Colbourn, Charles J ^a   Martirosyan, Sosina S ^a   Mullen, Gary L ^b   Shasha, Dennis ^c   Sherwood, George B ^d   Yucas, Joseph L ^e  

^a Arizona State University   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c POLYTECHNIC UNIVERSITY   (United States)

^d Testcovercom LLC   (United States)

^e Southern Illinois University Carbondale   (United States)

Author keywords

Covering array; Latin square; Orthogonal array

Indexed keywords

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

References (28)

1. M. A. Chateauneuf, C. J. Colbourn, and D. L. Kreher, Covering arrays of strength three, Des Codes Cryptogr 16(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 Engi 23(7) (1997), 437-444. (Pubitemid 127828305)
4. D. M. Cohen and M. L. Fredman, New techniques for designing qualitatively independent systems, J Combin Des 6(6) (1998), 411-416. (Pubitemid 128702863)
5. M. B. Cohen, C. J. Colbourn, J. S. Collofello, P. B. Gibbons, and W. B. Mugridge, Variable Strength Interaction Testing of Components, Proc. 27th Intl. Computer Software and Applications Conference (COMPSAC 2003), Dallas TX, November 2003, pp. 413-418.
6. M. B. Cohen, C. J. Colbourn, P. B. Gibbons, and W. B. Mugridge, Constructing test suites for interaction testing, In Proc. Intl. Conf. on Software Engineering (ICSE 2003), Portland, Oregon, May 2003, pp. 38-49.
7. M. B. Cohen, C. J. Colbourn, and A. C. H. Ling, Augmented simulated annealing to build interaction test suites, Proc. IEEE Int Symp Software Reliability Eng (ISSRE 2003), Denver CO, November 2003, pp. 394-405.
8. C. J. Colbourn, Combinatorial aspects of covering arrays, Le Matematiche (Catania), to appear.
9. C. J. Colbourn and J. H. Dinitz, editors, The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, 1996.
10. S. R. Dalal, A. J. N. Karunanithi, J. M. Leaton, G. C. Patton, and B. M. Horowitz, Modelbased testing in practice, In Proc. Intl. Conf. on Software Engineering, (ICSE'99), 1999, pp. 285-294, New York.
11. I. S. Dunietz, W. K. Ehrlich, B. D. Szablak, C. L. Mallows, and A. Iannino, Applying design of experiments to software testing, In Proc. Intl. Conf. on Software Engineering, (ICSE'97), 1997, pp. 205-215, New York.
12. A. S. Hedayat, N. J. A. Sloane, and J. Stufken, Orthogonal Arrays, Springer-Verlag, New York, 1999.
13. S. Martirosyan and T. Van Trung, On t-covering arrays, Des Codes Cryptogr 32(2004), 323-339.
14. K. Meagher and B. Stevens, Group construction of covering arrays, J Combin Des 13(1) (2005), 70-77. (Pubitemid 40054390)
15. L. Moura, J. Stardom, B. Stevens, and A. Williams, Covering arrays with mixed alphabet sizes, J Combin Des 11(6) (2003), 113-132.
16. G. L. Mullen and D. White, A polynomial representation for logarithms in GF (q), Acta Arithmetica 47(1986), 255-261.
17. K. Nurmela, Upper bounds for covering arrays by tabu search, Discrete Applied Math 138(2004), 143-152.
18. S. Poljak and Z. Tuza, On the maximum number of qualitatively independent partitions, J Combin Theory (A) 51(1989), 111-116.
19. D. E. Shasha, A. Y. Kouranov, L. V. Lejay, M. F. Chou, and G. M. Coruzzi, Using combinatorial design to study regulation by multiple input signals, A tool for parsimony in the post-genomics era, Plant Physiol 127(2001), 1590-1594. (Pubitemid 34050027)
20. G. Sherwood, On the Construction of Orthogonal Arrays and Covering Arrays Using Permutation Groups, Online at http://home.att.net/gsherwood/cover.htm
21. N. J. A. Sloane, Covering arrays and intersecting codes, J Combin Des 1(1) (1993), 51-63.
22. B. Stevens, Transversal Covers and Packings, Ph. D. Thesis, Mathematics, University of Toronto, 1998.
23. B. Stevens and E. Mendelsohn, New recursive methods for transversal covers, J Combin Des 7(3) (1999), 185-203.
24. B. Stevens, L. Moura, and E. Mendelsohn, Lower bounds for transversal covers, Des Codes Cryptogr 15(3) (1998), 279-299. (Pubitemid 128507653)
25. K. C. Tai and L. Yu, A test generation strategy for pairwise testing, IEEE Trans Soft Eng 28(1) (2002), 109-111.
26. Y.-W. Tung and W. S. Aldiwan, Automating test case generation for the new generation mission software system, In Proc. IEEE Aerospace Conf., 2000, pp. 431-437. (Pubitemid 32838334)
27. A. W. Williams and R. L. Probert, A practical strategy for testing pair-wise coverage of network interfaces, In Proc. Seventh Intl. Symp. on Software Reliability Engineering, 1996, pp. 246-254.
28. A. W. Williams and R. L. Probert, A measure for component interaction test coverage, In Proc. ACS/IEEE Intl. Conf. on Computer Systems and Applications, 2001, pp. 301-311.