• English
    • Norsk
  • English 
    • English
    • Norsk
  • Administration
View Item 
  •   Home
  • Det matematisk-naturvitenskapelige fakultet
  • Institutt for informatikk
  • Institutt for informatikk
  • View Item
  •   Home
  • Det matematisk-naturvitenskapelige fakultet
  • Institutt for informatikk
  • Institutt for informatikk
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Automated Composition of Refactorings

Kristiansen, Erlend
Master thesis
View/Open
master-thesis-erlenkr.pdf (5.490Mb)
Year
2014
Permanent link
http://urn.nb.no/URN:NBN:no-46474

Metadata
Show metadata
Appears in the following Collection
  • Institutt for informatikk [3608]
Abstract
Complex source code impacts the cost of software maintenance in a negative way. In an object-oriented context, one class may depend on a high number of other classes, thus contributing to the complexity of a program and making changing code prone to errors. Refactoring is a means to fight such complexity. This thesis investigates whether automated refactoring can be used to lower the coupling between classes. A search-based composite refactoring combining the primitive refactorings Extract Method and Move Method is designed as a possible solution to this problem. Case studies are conducted to evaluate the effect of executing the search-based refactoring in a large code base.
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy
 

 

For students / employeesSubmit master thesisAccess to restricted material

Browse

All of DUOCommunities & CollectionsBy Issue DateAuthorsTitlesThis CollectionBy Issue DateAuthorsTitles

For library staff

Login
RSS Feeds
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy