Frontiers of Computer Science in China

, Volume 3, Issue 1, pp 64–72

Runtime analysis of search heuristics on software engineering problems

Review Article

DOI: 10.1007/s11704-009-0006-6

Cite this article as:
Lehre, P.K. & Yao, X. Front. Comput. Sci. China (2009) 3: 64. doi:10.1007/s11704-009-0006-6


Many software engineering tasks can potentially be automated using search heuristics. However, much work is needed in designing and evaluating search heuristics before this approach can be routinely applied to a software engineering problem. Experimental methodology should be complemented with theoretical analysis to achieve this goal. Recently, there have been significant theoretical advances in the runtime analysis of evolutionary algorithms (EAs) and other search heuristics in other problem domains. We suggest that these methods could be transferred and adapted to gain insight into the behaviour of search heuristics on software engineering problems while automating software engineering.


software engineering evolutionary algorithms runtime analysis 

Copyright information

© Higher Education Press and Springer-Verlag GmbH 2009

Authors and Affiliations

  1. 1.The Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA), School of Computer ScienceUniversity of BirminghamBirminghamUK