Abstract
The aim of Search Based Software Engineering (SBSE) research is to provide automated optimization for activities right across the Software Engineering spectrum using a variety of techniques from the metaheuristic search, operations research and evolutionary computation paradigms. The SBSE approach has recently generated a great deal of interest, particularly in the field of Software Testing. There is a natural translation from test input spaces to the search spaces on which SBSE operates and from test criteria and goals to the formulation of the fitness functions with which the search based optimization algorithms are guided. This makes SBSE compelling and generic; many testing problems can be formulated as SBSE problems. This talk will give an overview of SBSE applications to testing, verification and debugging with some recent results and pointers to open problems and challenges.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Harman, M. (2011). The SBSE Approach to Automated Optimization of Verification and Testing. In: Namjoshi, K., Zeller, A., Ziv, A. (eds) Hardware and Software: Verification and Testing. HVC 2009. Lecture Notes in Computer Science, vol 6405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19237-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-19237-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19236-4
Online ISBN: 978-3-642-19237-1
eBook Packages: Computer ScienceComputer Science (R0)