<  Back to the Polytechnique Montréal portal

Levenshtein edit distance-based type III clone detection using metric trees

Thierry M. Lavoie and Ettore Merlo

Technical Report (2011)

[img]
Preview
Published Version
Terms of Use: Tous droits réservés.
Download (622kB)
Cite this document: Lavoie, T. M. & Merlo, E. (2011). Levenshtein edit distance-based type III clone detection using metric trees (Technical Report n° EPM-RT-2011-01).
Show abstract Hide abstract

Abstract

This paper presents an original technique for clone detection with metric trees using Levenshtein distance as the metric defined between two code fragments. This approach achieves a faster empirical performance. The resulting clones may be found with varying thresholds allowing type 3 clone detection. Experimental results of metric trees performance as well as clone detection statistics on an open source system are presented and give promising perspectives.

Open Access document in PolyPublie
Subjects: 2700 Technologie de l'information > 2705 Logiciels et développement
2700 Technologie de l'information > 2706 Génie logiciel
Department: Département de génie informatique et génie logiciel
Research Center: Non applicable
Funders: CRSNG/NSERC
Date Deposited: 06 Oct 2017 13:37
Last Modified: 24 Oct 2018 16:12
PolyPublie URL: https://publications.polymtl.ca/2638/

Statistics

Total downloads

Downloads per month in the last year

Origin of downloads

Repository Staff Only