An improved meta-heuristic search for constrained interaction testing

Proceedings - 1st International Symposium on Search Based Software Engineering, SSBSE 2009

Volumn , Issue , 2009, Pages 13-22

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

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL INTERACTIONS; CONFIGURABLE SYSTEMS; EMPIRICAL EVALUATIONS; GREEDY ALGORITHMS; INTERACTION TESTING; META HEURISTIC ALGORITHM; META-HEURISTIC SEARCH; PROBLEM STRUCTURE; REAL PROBLEMS; RUNTIMES; SAMPLING TECHNIQUE; SEARCH SPACES; SYSTEM CONFIGURATIONS; THREE ORDERS OF MAGNITUDE;

COMPUTER SOFTWARE; HEURISTIC METHODS; PORTALS; SIMULATED ANNEALING;

HEURISTIC ALGORITHMS;

EID: 70349271027     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSBSE.2009.25     Document Type: Conference Paper

References (24)

1. A. Calvagna and A. Gargantini. A logic-based approach to combinatorial testing with constraints. In Tests and Proofs, Lecture Notes in Computer Science, 4966, pages 66-83, 2008.
2. P. Clements and L. Northrup. Software Product Lines: Practices and Patterns. Addison-Wesley, 2002.
3. C. Coello Coello. Theoretical and numerical constraint handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering, 191(11-12):1245-1287, Jan. 2002.
4. 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-444, 1997.
5. M. B. Cohen, M. B. Dwyer, and J.Shi. Coverage and adequacy in software product line testing. In Proceedings of the Workshop on the Role of Architecture for Testing and Analysis, pages 53-63, July 2006.
6. M. B. Cohen, M. B. Dwyer, and J. Shi. Interaction testing of highly-configurable systems in the presence of constraints. In International Symposium on Software Testing and Analysis, pages 129-139, July 2007.
7. M. B. Cohen, M. B. Dwyer, and J. Shi. Constructing interaction test suites for highly-configurable systems in the presence of constraints: A greedy approach. IEEE Transactions on Software Engineering, 34(5):633-650, 2008.
8. M. B. Cohen, P. B. Gibbons, W. B. Mugridge, and C. J. Colbourn. Constructing test suites for interaction testing. Software Engineering, 2003. Proceedings. 25th International Conference on, pages 38-48, May 2003.
9. J. Czerwonka. Pairwise testing in real world. In Pacific Northwest Software Quality Conference, pages 419- 430, October 2006.
10. N. Éen and N. Sörrenson. MiniSAT-C v1.14.1. http: //minisat.se/, 2007.
11. A. Hartman and L. Raskin. Problems and algorithms for covering arrays. Discrete Math, 284:149-156, 2004.
12. B. Hnich, S. Prestwich, E. Selensky, and B. M. Smith. Constraint models for the covering test problem. Constraints, 11:199-219, 2006.
13. D. Kuhn, D. R.Wallace, and A. M. Gallo. Software fault interactions and implications for software testing. IEEE Transactions on Software Engineering, 30(6):418-421, 2004.
14. Y. Lei, R. Kacker, D. R. Kuhn, V. Okun, and J. Lawrence. IPOG: A general strategy for t-way software testing. Engineering of Computer-Based Systems, IEEE International Conference on the, pages 549-556, 2007.
15. S. Malik. zChaff. http://www.princeton.edu/-chaff/ zchaff.html, 2004.
16. A. Memon, A. Porter, C. Yilmaz, A. Nagarajan, D. C. Schmidt, and B. Natarajan. Skoll: Distributed continuous quality assurance. In Proceedings of the 26th IEEE and ACM SIGSOFT International Conference on Software Engineering (ICSE 2004), 2004.
17. H. Muccini and A. van der Hoek. Towards testing product line architectures. In Proceedings of the International Workshop on Test and Analysis of Component- Based Systems, pages 111-121, 2003.
18. K. J. Nurmela. Upper bounds for covering arrays by tabu search. Discrete Applied Mathematics, 138(1-2):143-152, 2004.
19. D. L. Parnas. On the design and development of program families. IEEE Transactions on Software Engineering, 2(1):1-9, 1976.
20. K. Pohl, G. Böckle, and F. van der Linden. Software Product Line Engineering. Springer, Berlin, 2005.
21. J. Stardom. Metaheuristics and the search for covering and packing arrays. Master's thesis, Simon Fraser University, 2001.
22. B. Stevens. Transversal Covers and Packings. PhD thesis, University of Toronto, 1998.
23. K. C. Tai and Y. Lei. A test generation strategy for pairwise testing. IEEE Transactions on Software Engineering, 28(1):109-111, 2002.
24. C. Yilmaz, M. B. Cohen, and A. Porter. Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Transactions on Software Engineering, 31(1):20-34, Jan 2006.