Constructing test suites for interaction testing

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2003, Pages 38-48

  Cohen, Myra B ^a   Gibbons, Peter B ^a   Mugridge, Warwick B ^a   Colbourn, Charles J ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b AZ 85281   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE SELECTION AND EVALUATION; HEURISTIC METHODS; STATISTICAL METHODS; TESTING;

INTERACTION TESTING; SOFTWARE SYSTEM FAULTS;

SOFTWARE ENGINEERING;

EID: 0037587652     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icse.2003.1201186     Document Type: Conference Paper

References (30)

1. I. Anderson. Combinatorial Designs and Tournaments. Oxford University Press, New York, 1997.
2. R. Brownlie, J. Prowse, and M. S. Padke. Robust testing of AT&T PMX/StarMAIL using OATS. AT&T Technical Journal, 71(3):41-7, 1992.
3. K. Burr and W. Young. Combinatorial test techniques: Table-based automation, test generation and code coverage. In Proc. of the Intl. Conf. on Software Testing Analysis & Review, 1998, San Diego.
4. M. Chateauneuf and D. Kreher. On the state of strength-three covering arrays. Journal of Combinatorial Designs, 10(4):217-238, 2002
5. 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 Transactions on Software Engineering, 23(7):437-44, 1997.
6. D. M. Cohen, S. R. Dalal, M. L. Fredman, and G. C. Patton. Method and system for automatically generating efficient test cases for systems having interacting elements United States Patent, Number 5,542,043, 1996.
7. D. M. Cohen, S. R. Dalal, J. Parelius, and G. C. Patton. The combinatorial design approach to automatic test generation. IEEE Software, 13(5):83-8, 1996.
8. D. M. Cohen and M. L. Fredman. New techniques for designing qualitatively independent systems. Journal of Combinatorial Designs, 6(6):411-16, 1998.
9. C. Colbourn and J. Dinitz. Making the MOLS table. In Computational and Constructive Design Theory, 1996, (W.D. Wallis, ed.) Kluwer Academi Press, 67-134.
10. S. R. Dalal, A. J. N. Karunanithi, J. M. L. Leaton, G. C. P. Patton, and B. M. Horowitz. Model-based testing in practice. In Proc. of the Intl. Conf. on Software Engineering,(ICSE '99), 1999, pp. 285-94, New York.
11. G. Dueck. New optimization heuristics - the great deluge algorithm and the record-to-record travel. Journal of Computational Physics, 104:86-92, 1993.
12. I. S. Dunietz, W. K. Ehrlich, B. D. Szablak, C. L. Mallows, and A. Iannino. Applying design of experiments to software testing. In Proc. of the Intl. Conf. on Software Engineering, (ICSE'97), 1997, pp. 205-215, New York.
13. L. Gargano, J. Körner, and U. Vaccaro. Capacities: from information theory to extremal set theory. J. Combin. Theory Ser. A, 68(2):296-316, 1994.
14. A. Hedayat, N. Sloane, and J. Stufken. Orthogonal Arrays. Springer-Verlag, New York, 1999.
15. G. Katona. Two applications (for search theory and truth functions) of Sperner type theorems. Periodica Math., 3:19-26, 1973.
16. D. Kleitman and J. Spencer. Families of k-independent sets. Discrete Math, 6:255-262, 1973.
17. R. Mandl. Orthogonal latin squares: an application of experiment design to compiler testing. Communications of the ACM, 28(10):1054-8, 1985.
18. K. Nurmela and P. R. J. Östergaard. Constructing covering designs by simulated annealing. Technical Report Digital Systems Laboratory, Helsinki Univ of Technology, 1993.
19. P. R. J. Östergård. Constructions of mixed covering codes. Technical report, Digital Systems Laboratory, Helsinki Univ. of Technology, 1991.
20. A. Réyni. Foundations of Probability. Wiley, New York, 1971.
21. N. Sloane. Covering arrays and intersecting codes. Journal of Combinatorial Designs, 1(1):51-63, 1993.
22. J. Stardom. Metaheuristics and the search for covering and packing arrays. Master's thesis, Simon Fraser University, 2001.
23. B. Stevens and E. Mendelsohn. Efficient software testing protocols. in Proc. of Center for Advanced Studies Conf. (Cascon '98), 1998, pp 270-293, Ontario.
24. B. Stevens and E. Mendelsohn. New recursive methods for transversal covers. Journal of Combinatorial Designs, 7(3):185-203, 1999.
25. B. Stevens, L. Moura, and E. Mendelsohn. Lower bounds for transversal covers. Designs Codes and Cryptography, 15(3):279-299, 1998.
26. K. C. Tai and L. Yu. A test generation strategy for pairwise testing. IEEE Transactions on Software Engineering, 28(1):109-111, 2002.
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-54.
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.
29. L. Yu and K. C. Tai. In-parameter-order: a test generation strategy for pairwise testing. In Proc. Third IEEE Intl. High-Assurance Systems Engineering Symp., 1998, pp. 254-261.
30. T. Yu-Wen and W. S. Aldiwan. Automating test case generation for the new generation mission software system. In Proc. IEEE Aerospace Conf., 2000, pp. 431-437.