Automated Detection of Refactorings in Evolving Components

Dig, Danny; Comertoglu, Can; Marinov, Darko; Johnson, Ralph

Permalink

https://hdl.handle.net/2142/11134 Copy

Description

Title

Automated Detection of Refactorings in Evolving Components

Author(s)

• Dig, Danny
• Comertoglu, Can
• Marinov, Darko
• Johnson, Ralph

Issue Date

2005-12

Keyword(s)

computer science

Abstract

One of the costs of reusing software components is migrating applications to use the new version of the components. Migrating an application can be error-prone, tedious, and disruptive of the development process. Our previous work shows that more than 80% of the disruptive changes in four different components were caused by refactorings. If the refactorings that happened between two versions of a component could be automatically detected, a refactoring tool could replay them on applications. We present an algorithm that detects refactorings performed during component evolution. Our algorithm uses a combination of a fast syntactic analysis to detect refactoring candidates and a more expensive semantic analysis to refine the results. The experiments on codebases ranging from 17 KLOC to 350 KLOC show that our algorithm detects refactorings in real-world components with accuracy over 85%.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11134

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections