A density-based greedy algorithm for higher strength covering arrays

Software Testing Verification and Reliability

Volumn 19, Issue 1, 2009, Pages 37-53

  Bryce, Renée C ^a   Colbourn, Charles J ^b  

^a University of Nevada Las Vegas   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Covering arrays; Greedy algorithm; Mixed level covering arrays; Software interaction testing; T way interaction coverage

Indexed keywords

COVERING ARRAYS; GREEDY ALGORITHM; MIXED-LEVEL COVERING ARRAYS; SOFTWARE INTERACTION TESTING; T-WAY INTERACTION COVERAGE;

COMPUTER SOFTWARE; TESTING;

ALGORITHMS;

EID: 69249171417     PISSN: 09600833     EISSN: 10991689     Source Type: Journal    
DOI: 10.1002/stvr.393     Document Type: Article

References (35)

1. Grindal M, Offutt J, Andler SF. Combination testing strategies - a survey. Software Testing, Verification, and Reliability 2005; 5(3):167-199.
2. Yilmaz C, Cohen MB, Porter A. Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Transactions on Software Engineering 2006; 31:20-34.
3. Dunietz S, Ehrlich WK, Szablak BD, Mallows CL, Iannino A. Applying design of experiments to software testing. Proceedings of the International Conference on Software Engineering (ICSE '97). IEEE: Los Alamitos, CA, 1997; 205-215.
4. Burr K, Young W. Combinatorial test techniques: Table-based automation, test generation, and code coverage. Proceedings of the International Conference on Software Testing Analysis and Review. ACM: New York, 1998; 503-513.
5. Berling T, Runeson P. Efficient evaluation of multifactor dependent system performance using fractional factorial design. IEEE Transactions on Software Engineering 2003; 29(9):769-781.
6. Kuhn DR, Reilly M. An investigation of the applicability of design of experiments to software testing. Proceedings of the 27th Annual NASA Goddard/IEEE Software Engineering Workshop. IEEE: Los Alamitos, CA, 2002; 91-95.
7. Kuhn DR, Wallace DR, Gallo AM. Software fault interactions and implications for software testing. IEEE Transactions on Software Engineering 2004; 30(6):418-421.
8. Lazić LJ, Velašević D. Applying simulation and design of experiments to the embedded software testing process. Software Testing, Verification, and Reliability 2004; 14(4):257-282.
9. Colbourn CJ. Combinatorial aspects of covering arrays. Le Matematiche (Catania) 2004; 58:121-167.
10. Hartman A. Software and hardware testing using combinatorial covering suites. Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, Golumbic MC, Hartman IB-A (eds.). Springer: Norwell, MA, 2005; 237-266.
11. Martirosyan SS, Colbourn CJ. Recursive constructions of covering arrays. Bayreuther Mathematische Schriften 2005; 74:266-275.
12. Martirosyan SS, Trung TV. On t-covering arrays. Designs Codes and Cryptography 2004; 32(1-3):323-339.
13. Sherwood GB, Martirosyan SS, Colbourn CJ. Covering arrays of higher strength from permutation vectors. Journal of Combinatorial Designs 2006; 14(3):202-213.
14. Chateauneuf M, Kreher DL. On the state of strength-three covering arrays. Journal of Combinatorial Designs 2002; 10(4):217-238.
15. Cohen MB, Colbourn CJ, Ling ACH. Constructing strength three covering arrays with augmented annealing. Discrete Mathematics 2008; DOI: 10.1016/j.disc.2006.06.036.
16. Colbourn CJ, Martirosyan SS, Trung TV, Walker RA II. Roux-type constructions for covering arrays of strengths three and four. Designs, Codes and Cryptography 2006; 41:33-57.
17. Hnich B, Prestwich S, Selensky E. Constraint-based approaches to the covering test problem. Recent Advances in Constraints (Lecture Notes in Computer Science, vol. 3419). Springer: Berlin, 2005; 172-186.
18. Nurmela K. Upper bounds for covering arrays by tabu search. Discrete Applied Mathematics 2004; 138(9):143-152.
19. IBM. ITCH. http://www.alphaworks.ibm.com/tech/whitch [28 March 2008].
20. Tai KC, Yu L. A test generation strategy for pairwise testing. IEEE Transactions on Software Engineering 2002; 28(1):109-111.
21. Lei Y, Kacker R, Kuhn DR, Okun V, Lawrence J. IPOG: A general strategy for t-way software testing. Fourteenth International Conference on Engineering of Computer-Based Systems. IEEE: Los Alamitos, CA, 2007; 549-556.
22. Jenkins R. jenny: A pairwise testing tool. http://www.burtleburtle.net/ bob/math/jenny.html [28 March 2008].
23. TVG. TVG testing tool. http://sourceforge.net/projects/tvg/ [28 March 2008].
24. Kuhn DR, Lei Y, Kacker R, Okun V, Lawrence J. Paintball: A fast algorithm for covering arrays of high strength. Internal Technical Report, NISTIR 7308, 2007.
25. Williams AW. Determination of test configurations for pair-wise interaction coverage. Testing of Communicating Systems: Tools and Techniques. Kluwer: Boston, Dordrecht, London, 2000; 59-74.
26. Bryce RC, Colbourn CJ. The density algorithm for pairwise interaction testing. Software Testing, Verification, and Reliability 2007; 17(3):159-182.
27. Poljak S, Pultr A, Rödl V. On qualitatively independent partitions and related problems. Discrete Applied Mathematics 1983; 6:193-205.
28. Poljak S, Tuza Z. On the maximum number of qualitatively independent partitions. Journal of Combinatorial Theory (A) 1989; 51:111-116.
29. Cohen DM, Dalal SR, Fredman ML, Patton GC. The AETG system: An approach to testing based on combinatorial design. IEEE Transactions on Software Engineering 1997; 23(7):437-444.
30. Cohen GD, Litsyn S, Zémor G. On greedy algorithms in coding theory. IEEE Transactions on Information Theory 1996; 42:2053-2057.
31. Bryce RC, Colbourn CJ. Prioritized interaction testing for pairwise coverage with seeding and avoids. Information and Software Technology Journal 2006; 48(10):960-970.
32. Bryce RC, Colbourn CJ, Cohen MB. A framework of greedy methods for constructing interaction tests. Proceedings of the 27th International Conference on Software Engineering (ICSE). IEEE: Los Alamitos, CA, 2005; 146-155.
33. Tung YW, Aldiwan WS. Automating test case generation for the new generation mission software system. Proceedings of the 30th IEEE Aerospace Conference. IEEE: Los Alamitos, CA, 2000; 431-437.
34. Colbourn CJ. Covering array tables. http://www.public.asu.edu/~ccolbou/ src/tabby [10 July 2007].
35. Cohen MB. Designing test suites for software interaction testing. PhD Thesis, Department of Computer Science, The University of Auckland, 2004.