Harman, M. and Tratt, L., 2007. Pareto Optimal Search Based Refactoring at the Design Level. In: Proceedings of the 9th annual conference on Genetic and evolutionary computation, July 7-11, 2007, University College London, pp. 1106-1113.
Full text not available from this repository.
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)|
|Subjects:||Generalities > Computer Science and Informatics|
Technology > Manufacturing and Design > Design
|Group:||School of Design, Engineering & Computing > Software Systems Research Centre|
|Deposited By:||INVALID USER|
|Deposited On:||28 Aug 2008 14:30|
|Last Modified:||07 Mar 2013 14:50|
|Repository Staff Only -|
|BU Staff Only -|
|Help Guide -||Editing Your Items in BURO|