Runtime analysis of search heuristics on software engineering problems

Per Kristian LEHRE, Xin YAO

Research output: Journal PublicationsJournal Article (refereed)peer-review

12 Citations (Scopus)

Abstract

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. © 2009 Higher Education Press and Springer-Verlag GmbH.
Original languageEnglish
Pages (from-to)64-72
Number of pages9
JournalFrontiers of Computer Science in China
Volume3
Issue number1
Early online date26 Feb 2009
DOIs
Publication statusPublished - Mar 2009
Externally publishedYes

Bibliographical note

The authors would like to thank Pietro Oliveto, Ramon Sagarna, Andrea Arcuri and the other members of the SEBASE project† for useful comments. This work was partially supported by EP-SRC (EP/C520696/1) and by the Royal Society under a grant in its UK-China Science Network programme.

Keywords

  • Evolutionary algorithms
  • Runtime analysis
  • Software engineering

Fingerprint

Dive into the research topics of 'Runtime analysis of search heuristics on software engineering problems'. Together they form a unique fingerprint.

Cite this