A novel mask-coding representation for set cover problems with applications in test suite minimisation

Proceedings - 2nd International Symposium on Search Based Software Engineering, SSBSE 2010

Volumn , Issue , 2010, Pages 19-28

  Yoo, Shin ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Search based software engineering; Set cover representation; Test suite minimisation

Indexed keywords

CODE COVERAGE; MULTI OBJECTIVE; OPTIMISATIONS; PROBLEM SPACE; REAL CODE; SEARCH-BASED SOFTWARE ENGINEERING; SET COVER; SET COVER PROBLEM; SET-COVER REPRESENTATION; SOLUTION SET; SOLUTION SPACE; TEST SUITE MINIMISATION;

COMPUTER SOFTWARE SELECTION AND EVALUATION; MULTIOBJECTIVE OPTIMIZATION; SOFTWARE TESTING;

SOFTWARE ENGINEERING;

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

References (24)

1. M. J. Harrold, R. Gupta, and M. L. Soffa, "A methodology for controlling the size of a test suite," ACM Transactions on Software Engineering and Methodology, vol. 2, no. 3, pp. 270-285, 1993.
2. J. Offutt, J. Pan, and J. Voas, "Procedures for reducing the size of coverage-based test sets," in Proceedings of the 12th International Conference on Testing Computer Software. ACM Press, June 1995, pp. 111-123.
3. T. Y. Chen and M. F. Lau, "Dividing strategies for the optimization of a test suite," Information Processing Letters, vol. 60, no. 3, pp. 135-141, 1996.
4. K. R. Walcott, M. L. Soffa, G. M. Kapfhammer, and R. S. Roos, "Time aware test suite prioritization," in Proceedings of the International Symposium on Software Testing and Analysis (ISSTA 2006). ACM Press, July 2006, pp. 1-12.
5. S. Yoo and M. Harman, "Pareto efficient multi-objective test case selection," in Proceedings of International Symposium on Software Testing and Analysis (ISSTA 2007). ACM Press, July 2007, pp. 140-150.
6. C. L. B. Maia, R. A. F. do Carmo, F. G. de Freitas, G. A. L. de Campos, and J. T. de Souza, "A multi-objective approach for the regression test case selection problem," in Proceedings of Anais do XLI Simpòsio Brasileiro de Pesquisa Operacional (SBPO 2009), 2009, pp. 1824-1835.
7. M. Harman and B. F. Jones, "Search based software engineering," Information and Software Technology, vol. 43, no. 14, pp. 833-839, Dec. 2001.
8. J. Gottlieb, B. A. Julstrom, F. Rothlauf, and G. R. Raidl, "Prüfer numbers: A poor representation of spanning trees for evolutionary search." in Proceedings of the 2001 Genetic and Evolutionary Computation Conference. Morgan Kaufmann, 2001, pp. 343-350.
9. F. Rothlauf, D. E. Goldberg, and A. Heinzl, "Network random keys - a tree representation scheme for genetic and evolutionary algorithms," Evolutionary Computation, vol. 10, no. 1, pp. 75-97, 2002.
10. R. H. Storer, S. D. Wu, and R. Vaccari, "New search spaces for sequencing problems with application to job shop scheduling," Journal of Management Science, vol. 38, no. 10, pp. 1495-1509, 1992.
11. R. Karp, "Reducibility among combinatorial problems," Complexity of Computer Computations, 1972.
12. D. Fudenberg and J. Tirole, Game Theory. MIT Press, 1983.
13. I. Charon and O. Hudry, "The noising method: a new method for combinatorial optimization," Operations Research Letters, vol. 14, no. 3, pp. 133-137, 1993.
14. C. Cotta and J. Troya, "A hybrid genetic algorithm for the 0-1 multiple knapsack problem," in Artificial Neural Networks and Genetic Algorithms. Springer-Verlag, 1997, pp. 251-255.
15. V. Sudhakar and C. Siva Ram Murthy, "A modified noising algorithm for the graph partitioning problem," Integration, the VLSI Journal, vol. 22, no. 1-2, pp. 101-113, 1997.
16. M. J. Morgan and C. L. Mumford, "A weight-coded genetic algorithm for the capacitated arc routing problem," in Proceedings of the 11th Annual conference on Genetic and Evolutionary Computation (GECCO 2009). New York, NY, USA: ACM, 2009, pp. 325-332.
17. B. Codenotti, G. Manzini, L. Margara, and G. Resta, "Perturbation: An efficient technique for the solution of very large instances of the euclidean tsp," INFORMS JOURNAL ON COMPUTING, vol. 8, no. 2, pp. 125-133, 1996.
18. H. Do, S. G. Elbaum, and G. Rothermel, "Supporting controlled experimentation with testing techniques: An infrastructure and its potential impact." Empirical Software Engineering, vol. 10, no. 4, pp. 405-435, 2005.
19. N. Nethercote and J. Seward, "Valgrind: A program supervision framework," in Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2007). ACM Press, June 2007, pp. 89-100.
20. K. Praditwong and X. Yao, "A new multi-objective evolutionary optimisation algorithm: The two-archive algorithm," in Proceedings of Computational Intelligence and Security, International Conference, ser. Lecture Notes in Computer Science, vol. 4456, November 2006, pp. 95-104.
21. D. S. Johnson, "Approximation algorithms for combinatorial problems," in Proceedings of the 5th annual ACM Symposium on Theory of Computing (STOC 1973). ACM Press, May 1973, pp. 38-49.
22. J. Rice, Mathematical Statistics and Data Analysis. Duxbury Press, 2nd Ed. 1995.
23. J. Black, E. Melachrinoudis, and D. Kaeli, "Bi-criteria models for all-uses test suite reduction," in Proceedings of the 26th International Conference on Software Engineering (ICSE 2004). ACM Press, May 2004, pp. 106-115.
24. G. Rothermel, M. Harrold, J. Ronne, and C. Hong, "Empirical studies of test suite reduction," Software Testing, Verification, and Reliability, vol. 4, no. 2, pp. 219-249, December 2002.