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. . [Conference or Workshop Item]

Download (377kB) | Preview


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. > School of Science and Technology > Computer and Communications Engineering
ISI Impact: 11
Item ID: 5905
Useful Links:
Depositing User: Dr Laurence Tratt
Date Deposited: 28 May 2010 09:14
Last Modified: 30 Nov 2022 01:57

Actions (login required)

View Item View Item


Activity Overview
6 month trend
6 month trend

Additional statistics are available via IRStats2.