Pareto Optimal Search Based Refactoring at the Design Level

Research output: Chapter in Book/Report/Conference proceedingConference paper

179 Citations (Scopus)

Abstract

Refactoring aims to improve the quality of a software system's 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.
Original languageEnglish
Title of host publicationUnknown
Place of PublicationNEW YORK
PublisherASSOC COMPUTING MACHINERY
Pages1106 - 1113
Number of pages8
ISBN (Print)978-1-59593-697-4
Publication statusPublished - 2007
EventAnnual Conference of Genetic and Evolutionary Computation Conference - London, ENGLAND
Duration: 7 Jul 200711 Jul 2007

Publication series

NameGECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2

Conference

ConferenceAnnual Conference of Genetic and Evolutionary Computation Conference
CityLondon, ENGLAND
Period7/07/200711/07/2007

Fingerprint

Dive into the research topics of 'Pareto Optimal Search Based Refactoring at the Design Level'. Together they form a unique fingerprint.

Cite this