Accurate and efficient refactoring detection in commit history
Abstract
Refactoring detection algorithms have been crucial to a variety of applications: (i) empirical studies about the evolution of code, tests, and faults, (ii) tools for library API migration, (iii) improving the comprehension of changes and code reviews, etc. However, recent research has questioned the accuracy of the state-of-the-art refactoring detection tools, which poses threats to the reliability of their application. Moreover, previous refactoring detection tools are very sensitive to user-provided similarity thresholds, which further reduces their practical accuracy. In addition, their requirement to build the project versions/revisions under analysis makes them inapplicable in many real-world scenarios.
BibTeX
@inproceedings{Tsantalis-al:ICSE18,
author = {Nikolaos Tsantalis and
Matin Mansouri and
Laleh Mousavi Eshkevari and
Davood Mazinanian and
Danny Dig},
title = {Accurate and efficient refactoring detection in commit history},
booktitle = {ICSE},
pages = {483--494},
publisher = {{ACM}},
year = {2018},
}