Evaluating improvements to a meta-heuristic search for constrained interaction testing

Empirical Software Engineering

Volumn 16, Issue 1, 2011, Pages 61-102

  Garvin, Brady J ^a   Cohen, Myra B ^a   Dwyer, Matthew B ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

Configurable software; Constrained combinatorial interaction testing; Search based software engineering

Indexed keywords

COMBINATORIAL INTERACTION TESTING; CONFIGURABLE; CONFIGURABLE SYSTEMS; CONSTRAINED PROBLEM; GREEDY ALGORITHMS; INTERACTION TESTING; META HEURISTIC ALGORITHM; META-HEURISTIC SEARCH; META-HEURISTIC SEARCH ALGORITHMS; REAL-WORLD; REAL-WORLD PROBLEM; RUNTIMES; SAMPLING TECHNIQUE; SEARCH BASED SOFTWARE ENGINEERING; SYSTEM CONFIGURATIONS; TESTING CONFIGURATIONS;

HEURISTIC METHODS; MODULAR ROBOTS; SIMULATED ANNEALING; SOFTWARE ENGINEERING;

HEURISTIC ALGORITHMS;

EID: 79951517778     PISSN: 13823256     EISSN: 15737616     Source Type: Journal    
DOI: 10.1007/s10664-010-9135-7     Document Type: Article

References (41)

1. RC Bryce CJ Colbourn 2006 Prioritized interaction testing for pair-wise coverage with seeding and constraints Inform Software Tech 48 10 960 970 10.1016/j.infsof.2006.03.004 (Pubitemid 44354089)
2. Bryce R, Colbourn CJ (2007) One-test-at-a-time heuristic search for interaction test suites. In: 9th conference on genetic and evolutionary computation, pp 1082-1089 (Pubitemid 47291666)
3. Bryce R, Colbourn CJ, Cohen MB (2005) A framework of greedy methods for constructing interaction tests. In: 27th international conference on software engineering, pp 146-155
4. Calvagna A, Gargantini A (2009) Combining satisfiability solving and heuristics to constrained combinatorial interaction testing. In: 3rd international conference on tests and proofs. Springer, pp 27-42
5. M Chateauneuf DL Kreher 2002 On the state of strength-three covering arrays J Comb Des 10 4 217 238 1003.05022 10.1002/jcd.10002 1905540
6. Clements P, Northrup L (2002) Software product lines: practices and patterns. Addison-Wesley
7. C Coello Coello 2002 Theoretical and numerical constraint handling techniques used with evolutionary algorithms: a survey of the state of the art Comput Methods Appl Mech Eng 191 11-12 1245 1287 1026.74056 10.1016/S0045- 7825(01)00323-1 1877684 (Pubitemid 34099386)
8. DM Cohen SR Dalal ML Fredman GC Patton 1997 The AETG system: an approach to testing based on combinatorial design IEEE Trans Softw Eng 23 7 437 444 10.1109/32.605761 (Pubitemid 127828305)
9. Cohen MB, Colbourn CJ, Ling ACH (2003a) Augmenting simulated annealing to build interaction test suites. In: 14th international symposium on software reliability engineering, pp 394-405
10. Cohen MB, Gibbons PB, Mugridge WB, Colbourn CJ (2003b) Constructing test suites for interaction testing. In: 25th international conference on software engineering, pp 38-48
11. Cohen MB, Dwyer MB, Shi J (2007a) Exploiting constraint solving history to construct interaction test suites. In: 2nd testing: academic and industrial conference-practice and research techniques, pp 121-130
12. Cohen MB, Dwyer MB, Shi J (2007b) Interaction testing of highly-configurable systems in the presence of constraints. In: 5th international symposium on software testing and analysis, pp 129-139 (Pubitemid 47317587)
13. MB Cohen MB Dwyer J Shi 2008 Constructing interaction test suites for highly-configurable systems in the presence of constraints: a greedy approach IEEE Trans Softw Eng 34 5 633 650 10.1109/TSE.2008.50
14. Colbourn C (2009) Covering array tables. Available at http://www.public.asu.edu/~ccolbou/src/tabby/catable.html. Accessed 28 September 2009
15. CJ Colbourn 2004 Combinatorial aspects of covering arrays Le Matematiche (Catania) 58 121 167
16. Colbourn CJ, Cohen MB, Turban RC (2004) A deterministic density algorithm for pairwise interaction coverage. In: 1st IASTED international conference on software engineering, pp 345-352
17. Czerwonka J (2006) Pairwise testing in real world. In: 10th Pacific northwest software quality conference, pp 419-430
18. Eén N, Sörrenson N (2007) MiniSAT-C v1.14.1. Available at http://minisat.se/. Accessed 29 June 2010
19. Fouché S, Cohen MB, Porter A (2009) Incremental covering array failure characterization in large configuration spaces. In: 7th international symposium on software testing and analysis, pp 177-187
20. Garousi V (2008) Empirical analysis of a genetic algorithm-based stress test technique. In: Proceedings of annual conference on genetic and evolutionary computation, pp 1743-1750
21. Garvin BJ, Cohen MB, Dwyer MB (2009) An improved meta-heuristic search for constrained interaction testing. In: 1st international symposium on search based software engineering, pp 13-22
22. Grieskamp W, Qu X, Wei X, Kicillof N, Cohen MB (2009) Interaction coverage meets path coverage by SMT constraint solving. In: Testing of communicating systems and international workshop on formal approaches to testing of software
23. Harman M (2007) The current state and future of search based software engineering. In: Future of software engineering, pp 342-357 (Pubitemid 47484936)
24. Harman M, Tratt L (2007) Pareto optimal search based refactoring at the design level. In: 9th conference on genetic and evolutionary computation, pp 1106-1113 (Pubitemid 47291669)
25. Harman M, Swift S, Mahdavi K (2005) An empirical study of the robustness of two module clustering fitness functions. In: 7th conference on genetic and evolutionary computation, pp 1029-1036 (Pubitemid 43226411)
26. A Hartman L Raskin 2004 Problems and algorithms for covering arrays Discrete Math 284 149 156 1044.05029 10.1016/j.disc.2003.11.029 2071905
27. B Hnich S Prestwich E Selensky BM Smith 2006 Constraint models for the covering test problem Constraints 11 199 219 1103.68810 10.1007/s10601-006-7094- 9 2224851
28. DR Kuhn DR Wallace AM Gallo 2004 Software fault interactions and implications for software testing IEEE Trans Softw Eng 30 6 418 421 10.1109/TSE.2004.24
29. Lei Y, Tai KC (1998) In-parameter-order: a test generation strategy for pairwise testing. In: 3rd international symposium on high-assurance systems engineering, pp 254-261
30. Lei Y, Kacker R, Kuhn DR, Okun V, Lawrence J (2007) IPOG: a general strategy for t-way software testing. In: 14th international conference on the engineering of computer-based systems, pp 549-556 (Pubitemid 46900712)
31. Z Li M Harman RM Hierons 2007 Search algorithms for regression test case prioritization IEEE Trans Softw Eng 33 4 225 237 10.1109/TSE.2007.38 (Pubitemid 46523213)
32. Malik S (2004) zChaff. Available at http://www.princeton.edu/~chaff/ zchaff.html. Accessed 29 June 2010
33. P McMinn 2004 Search-based software test data generation: a survey Softw Test Verif Reliab 14 2 105 156 10.1002/stvr.294
34. Memon A, Porter A, Yilmaz C, Nagarajan A, Schmidt DC, Natarajan B (2004) Skoll: distributed continuous quality assurance. In: 26th international conference on software engineering
35. KJ Nurmela 2004 Upper bounds for covering arrays by tabu search Discrete Appl Math 138 1-2 143 152 1034.05013 10.1016/S0166-218X(03)00291-9 2057607
36. Pohl K, Böckle G, van der Linden F (2005) Software product line engineering. Springer, Berlin
37. Qu X, Cohen MB, Rothermel G (2008) Configuration-aware regression testing: an empirical study of sampling and prioritization. In: 6th international symposium on software testing and analysis, pp 75-85
38. Stardom J (2001) Metaheuristics and the search for covering and packing arrays. Master's thesis, Simon Fraser University
39. Stevens B (1998) Transversal covers and packings. PhD thesis, University of Toronto
40. KC Tai Y Lei 2002 A test generation strategy for pairwise testing IEEE Trans Softw Eng 28 1 109 111 10.1109/32.979992 (Pubitemid 34129838)
41. C Yilmaz MB Cohen A Porter 2006 Covering arrays for efficient fault characterization in complex configuration spaces IEEE Trans Softw Eng 31 1 20 34 10.1109/TSE.2006.8 (Pubitemid 43193063)