Pareto optimal search based refactoring at the design level.
Harman, Mark and Tratt, Laurence (2007) Pareto optimal search based refactoring at the design level. In: 9th annual conference on Genetic and evolutionary computation conference (GEECO 2007), 7 - 11 July, 2007, University College, London.
Refactoring aims to improve the quality of a software systems’ structure, which tends to degrade as the system evolves. While manually determining useful refactorings can be challenging, search based techniques can automatically discover useful refactorings. Current search based refactoring approaches require metrics to be combined in a complex fashion, and produce a single sequence of refactorings. In this paper we show how Pareto optimality can improve search based refactoring, making the combination of metrics easier, and aiding the presentation of multiple sequences of optimal refactorings to users.
|Item Type:||Conference or Workshop Item (Paper)|
|Research Areas:||A. Middlesex University Schools and Centres > School of Science and Technology > Computer and Communications Engineering|
|Citations on ISI Web of Science:||11|
|Deposited On:||28 May 2010 09:14|
|Last Modified:||20 Jul 2014 14:54|
Repository staff only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year