A backtracking search tool for constructing combinatorial test suites

Journal of Systems and Software

Volumn 81, Issue 10, 2008, Pages 1681-1693

  Yan, Jun ^a   Zhang, Jian ^a  

^a INSTITUTE OF SOFTWARE   (China)

Author keywords

Combinatorial testing; Covering array; Optimal test set; Orthogonal array; Software testing

Indexed keywords

HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; KETONES; LEARNING ALGORITHMS; MATRIX ALGEBRA; TESTING;

BACKTRACKING SEARCH; COMBINATORIAL TESTING; COVERING ARRAY; EXHAUSTIVE SEARCH; OPTIMAL TEST SET; ORTHOGONAL ARRAY; ORTHOGONAL ARRAYS; SEARCH HEURISTICS; SEARCH TIME; SOFTWARE TESTING; SYMMETRY BREAKING; SYSTEM-UNDER-TEST; TEST CASES; TEST GENERATIONS; TEST SUITES; TESTING METHODS;

COMBINATORIAL MATHEMATICS;

EID: 48649110699     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jss.2008.02.034     Document Type: Article

References (34)

1. Brouwer A.E., Cohen A.M., and Nguyen M.V.M. Orthogonal arrays of strength 3 and small run sizes. Journal of Statistical Planning and Inference 136 (2006) 3268-3280
2. Chateauneuf M., and Kreher D. On the state of strength-three covering arrays. Journal of Combinatorial Designs 10 4 (2002) 217-238
3. Chateauneuf M.A., Colbourn C.J., and Kreher D.L. Covering arrays of strength three. Designs, Codes and Cryptography 16 3 (1999) 235-242
4. Cheng, C.T., Dumitrescu, A., Schroeder, P.J., 2003. Generating small combinatorial test suites to cover input-output relationships. In: Proceedings of 3rd International Conference on Quality Software (QSIC'03), pp. 76-83.
5. Cohen D.M., Dalal S.R., Fredman M.L., and Patton G.C. The AETG system: an approach to testing based on combinatorial design. IEEE Transactions on Software Engineering 23 7 (1997) 437-443
6. Cohen, M.B., Gibbons, P.B., Mugridge, W.B., Colbourn, C.J., 2003. Constructing test suites for interaction testing. In: Proceedings of the 25th International Conference on Software Engineering (ICSE'03), pp. 38-48.
7. Colbourn C.J. Combinatorial aspects of covering arrays. Le Matematiche (Catania) 58 (2004) 121-167
8. In: Colbourn C.J., and Dinitz J.H. (Eds). Handbook of Combinatorial Designs. second ed. Discrete Mathematics and its Applications (2006), Chapman & Hall/CRC
9. Colbourn C.J., Martirosyan S.S., Mullen G.L., Shasha D., Sherwood G.B., and Yucas J.L. Products of mixed covering arrays of strength two. Journal of Combinatorial Designs 14 2 (2006) 124-138
10. Colbourn, C.J., 2007. CA tables for t = 2, 3, 4, 5, 6. .
11. Dalal, S.R., Jain, A., Karunanithi, N., Leaton, J.M., Lott, C.M., Patton, G.C., Horowitz, B.M., 1999. Model-based testing in practice. In: Proceedings of the 21th International Conference on Software Engineering (ICSE'99), pp. 285-294.
12. Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T., 2002. Breaking row and column symmetries in matrix models. In: Proceedings of 8th International Conference on Principles and Practice of Constraint Programming, LNCS 2470, pp. 462-477.
13. Godbole A.P., Skipper D.E., and Sunley R.A. t-covering arrays: upper bounds and Poisson approximations. Combinatorics, Probability and Computing (1996) 105-118
14. Grindal M., Offutt J., and Andler S.F. Combination testing strategies: a survey, software testing. Verification and Reliability 15 3 (2005) 167-199
15. Hnich B., Prestwich S.D., Selensky E., and Smith B.M. Constraint models for the covering test problem. Constraints 11 2-3 (2006) 199-219
16. E X. fourth ed. (2004), Addison-Wesley, Boston, MA
17. Kuhn, D.R., 2006. An algorithm for generating very large covering arrays. Technical report NISTIR 7308.
18. Kuhn, D.R., Reilly, M.J., 2002. An investigation of the applicability of design of experiments to software testing. In: Proceedings of the 27th Annual NASA Goddard Software Engineering Workshop (SEW'02), pp. 91-95.
19. Lei, Y., Tai, K.C., 1998. In-Parameter-Order: a test generation strategy for pairwise testing. In: Proceedings of 3rd IEEE International Symposium on High Assurance Systems Engineering, pp. 254-261.
20. Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J., 2007. IPOG: a general strategy for t-way software testing. In: Proceedings of 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07), pp. 549-556.
21. Martirosyan S., and van Trung T. On t-covering arrays. Designs, Codes and Cryptography 32 1 (2004) 323-339
22. Mathur, A.P., 2007. Foundations of software testing, draft v4.x Edition. .
23. Meagher K., and Stevens B. Covering arrays on graphs. Journal of Combinatorial Theory, Series B 95 1 (2005) 134-151
24. Nurmela K.J. Upper bounds for covering arrays by tabu search. Discrete Applied Mathematics 138 1-2 (2004) 143-152
25. Schroeder, P.J., Bolaki, P., Gopu, V., 2004. Comparing the fault detection effectiveness of n-way and random test suites. In: Proceedings of International Symposium on Empirical Software Engineering (ISESE'04), pp. 49-59.
26. Seroussi G., and Bshouty N.H. Vector sets for exhaustive testing of logical circuits. IEEE Transactions on Information Theory 34 (1988) 513-522
27. Shiba, T., Tsuchiya, T., Kikuno, T., 2004. Using artificial life techniques to generate test cases for combinatorial testing. In: Proceedings of the 28th Annual International Computer Software and Applications Conference (COMPSAC'04), pp. 72-77.
28. Sloane, N.J.A., 2007. A library of orthogonal arrays. .
29. Stevens B., and Mendelsohn E. New recursive methods for transversal covers. Journal of Combinatorial Designs 7 3 (1999) 185-203
30. Tung, Y.-W., Aldiwan, W.S., 2000. Automating test case generation for the new generation mission software system. In: Proceedings of IEEE Aerospace Conference, pp. 431-437.
31. Williams, A.W., Probert, R.L., 1996. A practical strategy for testing pair-wise coverage of network interfaces. In: Proceedings of 7th International Symposium on Software Reliability Engineering (ISSRE'96), pp. 246-254.
32. Yan, J., Zhang, J., 2006. Backtracking algorithms and search heuristics to generate test suites for combinatorial testing. In: Proceedings of 30th Annual International Computer Software and Applications Conference (COMPSAC'06), pp. 385-394.
33. Yilmaz C., Cohen M.B., and Porter A.A. Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Transactions on Software Engineering 32 1 (2006) 20-34
34. Zhang, J., 2001. Automatic symmetry breaking method combined with SAT. In: Proceedings of the 2001 ACM Symposium on Applied Computing (SAC'01), pp. 17-21.