Detecting Refactorable Clones by Slicing Program Dependence Graphs
Ammar Hamid, Vadim Zaytsev · UvA-DARE (University of Amsterdam) · 2015
Code duplication in a program can make understanding and maintenance difficult. The problem can be reduced by detecting duplicated code, refactoring it into a separate procedure, and replacing all the clones by appropriate calls to the new procedure. In this paper, we report on a confirmatory replication of a tool that was used to detect such refactorable clones based on program dependence graphs and program slicing.