Problems and algorithms for covering arrays

Discrete Mathematics

Volumn 284, Issue 1-3, 2004, Pages 149-156

  Hartman, Alan ^a   Raskin, Leonid ^a  

^a IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

Covering array; Orthogonal array

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; PROBLEM SOLVING; REGRESSION ANALYSIS; SET THEORY; VECTORS;

COVERING ARRAYS; HETEROGENEOUS ALPHABETS; ORTHOGONAL ARRAYS;

COMBINATORIAL MATHEMATICS;

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

References (18)

1. S.Y. Boroday, Determining essential arguments of Boolean functions, in: Proceedings of the Conference on Industrial Mathematics, Taganrog, 1998, pp. 59-61 (in Russian). (The translation is a personal communication from the author).
2. Bush K.A. A generalization of the theorem due to MacNeish. Ann. Math. Statist. 23:1952;293-295.
3. Bush K.A. Orthogonal arrays of index unity. Ann. Math. Statist. 23:1952;426-434.
4. Chateauneuf M.A., Colbourn C.J., Kreher D.L. Covering arrays of strength 3. Des. Codes Cryptogr. 16:1999;235-242.
5. Chateauneuf M.A., Kreher D.L. On the state of strength 3 covering arrays. J. Combin. Des. 10:2002;217-238.
6. Cohen D.M., Dalal S.R., Fredman M.L., Patton G.C. The AETG system. an approach to testing based on combinatorial design IEEE Trans. Software Eng. 23:1997;437-444.
7. Colbourn C.J., Dinitz J.H. The CRC Handbook of Combinatorial Designs. 1996;CRC Press, Boca Raton, FL.
8. A. Hartman, Software and hardware testing using combinatorial covering suites, in: M.C. Golumbic and I.B.-A. Hartman (Eds.), Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms, to appear.
9. A. Hartman, L. Raskin, Combinatorial Test Services - a software package. Available at http://www.alphaworks.ibm.com/.
10. Y. Lei, K.C. Tai, In-parameter order: a test generation strategy for pairwise testing, in: Proceedings of the Third IEEE High Assurance Systems Engineering Symposium, Washington, DC, 1998, pp. 254-261.
11. L. Moura, J. Stardom, B. Stevens, A. Williams, Covering arrays with heterogeneous alphabet sizes, preprint June 2002.
12. Rényi A. Foundations of Probability. 1971;Wiley, New York.
13. G. Roux, k-propriétés dans les tableaux de n colonnes; cas particulier de la k-surjectivité et de la k-permutativité, Ph.D. Dissertation, University of Paris 6, 1987.
14. Stevens B., Ling A., Mendelsohn E. A direct construction of transversal covers using group divisible designs. Ars Combin. 63:2002;145-159.
15. Stevens B., Mendelsohn E. New recursive methods for transversal covers. J. Combin. Des. 7:1999;185-203.
16. Tang D.T., Chen C.L. Iterative exhaustive pattern generation for logic testing. IBM J. Res. Develop. 28:1984;212-219.
17. West D.B. Introduction to Graph Theory. 1996;Prentice-Hall, Englewood Cliffs, NJ.
18. 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), Ottawa Canada, 2000, pp. 59-74.