Elementary landscape decomposition of the test suite minimization problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6956 LNCS, Issue , 2011, Pages 48-63

  Chicano, Francisco ^a   Ferrer, Javier ^a   Alba, Enrique ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

elementary landscapes; Fitness landscapes; regression testing; test suite minimization

Indexed keywords

ADDITIONAL KNOWLEDGE; COMBINATORIAL OPTIMIZATION PROBLEMS; ELEMENTARY LANDSCAPES; FITNESS LANDSCAPE; FORMAL FRAMEWORK; OBJECTIVE FUNCTIONS; REGRESSION TESTING; SEARCH METHOD; TEST SUITE MINIMIZATION;

COMBINATORIAL OPTIMIZATION; SOFTWARE ENGINEERING;

SOFTWARE TESTING;

EID: 80052904134     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23716-4_7     Document Type: Conference Paper

References (14)

1. Chicano, F., Whitley, L.D., Alba, E.: A methodology to find the elementary landscape decomposition of combinatorial optimization problems. Evolutionary Computation (in Press) doi: 10.1162/EVCO a 00039
2. Do, H., Elbaum, S., Rothermel, G.: Supporting controlled experimentation with testing techniques: An infrastructure and its potential impact. Empirical Softw. Engg. 10, 405-435 (2005), http://portal.acm.org/citation.cfm?id=1089922. 1089928
3. Feinsilver, P., Kocik, J.: Krawtchouk polynomials and krawtchouk matrices. In: Baeza-Yates, R., Glaz, J., Gzyl, H. (eds.) Recent Advances in Applied Probability, pp. 115-141. Springer, US (2005)
4. Langdon, W.B.: Elementary bit string mutation landscapes. In: Beyer, H.-G., Langdon, W.B. (eds.) Foundations of Genetic Algorithms, January 5-9, 2011, pp. 25-41. ACM Press, Schwarzenberg (2011)
5. Lu, G., Bahsoon, R., Yao, X.: Applying elementary landscape analysis to search-based software engineering. In: Proceedings of the 2nd International Symposium on Search Based Software Engineering (2010)
6. Rana, S., Heckendorn, R.B., Whitley, D.: A tractable walsh analysis of SAT and its implications for genetic algorithms. In: Proceedings of AAAI, pp. 392-397. AAAI Press, Menlo Park (1998)
7. Reidys, C.M., Stadler, P.F.: Combinatorial landscapes. SIAM Review 44(1), 3-54 (2002)
8. Stadler, P.F.: Toward a theory of landscapes. In: López- Peña, R., Capovilla, R., García-Pelayo, R., Waelbroeck, H., Zertruche, F. (eds.) Complex Systems and Binary Networks, pp. 77-163. Springer, Heidelberg (1995)
9. Sutton, A.M., Howe, A.E.,Whitley, L.D.: Directed plateau search for MAX-k-SAT. In: Proceedings of SoCS, Atlanta, GA, USA (July 2010)
10. Sutton, A.M., Whitley, L.D., Howe, A.E.: Computing the moments of k-bounded pseudo-boolean functions over Hamming spheres of arbitrary radius in polynomial time. Theoretical Computer Science (in press) doi:10.1016/j.tcs.2011. 02.006
11. Sutton, A.M.,Whitley, L.D., Howe, A.E.: A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. In: Proceedings of GECCO, pp. 365-372. ACM, New York (2009)
12. Whitley, D., Sutton, A.M., Howe, A.E.: Understanding elementary landscapes. In: Proceedings of GECCO, pp. 585-592. ACM, New York (2008)
13. Yoo, S., Harman, M.: Pareto efficient multi-objective test case selection. In: Proceedings of the 2007 International Symposium on Software Testing and Analysis (ISSTA 2007), July 9-12, 2007, pp. 140-150. ACM, London (2007)
14. Yoo, S., Harman, M.: Regression testing minimisation, selection and prioritisation: A survey. Journal of Software Testing, Verification and Reliability (2010)