Abstract
Landscape theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of a special kind of landscape called elementary landscape. The decomposition of the objective function of a problem into its elementary components provides additional knowledge on the problem that can be exploited to create new search methods for the problem. We analyze the Test Suite Minimization problem in Regression Testing from the point of view of landscape theory. We find the elementary landscape decomposition of the problem and propose a practical application of such decomposition for the search.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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
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
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)
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)
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)
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)
Reidys, C.M., Stadler, P.F.: Combinatorial landscapes. SIAM Review 44(1), 3–54 (2002)
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)
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)
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
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)
Whitley, D., Sutton, A.M., Howe, A.E.: Understanding elementary landscapes. In: Proceedings of GECCO, pp. 585–592. ACM, New York (2008)
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)
Yoo, S., Harman, M.: Regression testing minimisation, selection and prioritisation: A survey. Journal of Software Testing, Verification and Reliability (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chicano, F., Ferrer, J., Alba, E. (2011). Elementary Landscape Decomposition of the Test Suite Minimization Problem. In: Cohen, M.B., Ó Cinnéide, M. (eds) Search Based Software Engineering. SSBSE 2011. Lecture Notes in Computer Science, vol 6956. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23716-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-23716-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23715-7
Online ISBN: 978-3-642-23716-4
eBook Packages: Computer ScienceComputer Science (R0)