Towards flexible code clone detection, management, and refactoring in IDE

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2011, Pages 75-76

  Zibran, Minhaz F ^a   Roy, Chanchal K ^a  

^a UNIVERSITY OF SASKATCHEWAN   (Canada)

Author keywords

Clone analysis; Detection; Maintenance; Refactoring

Indexed keywords

CLONE ANALYSIS; CLONE MANAGEMENT; CODE CLONE; CODE CLONE DETECTION; DEVELOPMENT PROCESS; PLUG-INS; REAL-TIME CODES; REFACTORINGS; SEMI-AUTOMATED; SUFFIX-TREES;

ALGORITHMS; CLONING; COMPUTER SOFTWARE MAINTENANCE; INTEGRODIFFERENTIAL EQUATIONS; TREES (MATHEMATICS);

CODES (SYMBOLS);

EID: 79959541424     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1985404.1985423     Document Type: Conference Paper

References (6)

1. Y. Higo, T. Kamiya, S. Kusumoto, and K. Inoue. Refactoring support based on code clone analysis. In PROFES'04, pp. 220-233, 2004.
2. G. Landau and U. Vishkin. Fast parallel and serial approximate string matching. J. Algorithms, 10(2): 157 - 169, 1989.
3. M. O. Rabin. Fingerprinting by random polynomials. Report TR-15-81, Harvard University, 1981.
4. C. K. Roy, J. R. Cordy, and R. Koschke. Comparison and evaluation of code clone detection techniques and tools: a qualitative approach. Sc. of Com. Prog., 74: 470-495, 2009.
5. C. K. Roy and J. R. Cordy. NICAD: Accurate detection of near-miss intentional clones using flexible pretty-printing and code normalization. In ICPC'08, pp. 172-181, 2008.
6. E. Ukkonen. Online construction of suffix trees. Algorithmica, 14: 249 - 260, 1995.