DocumentCode :
2834004
Title :
Clone Detection Using Abstract Syntax Suffix Trees
Author :
Koschke, Rainer ; Falke, Raimar ; Frenzel, Pierre
Author_Institution :
Bremen Univ.
fYear :
2006
fDate :
Oct. 2006
Firstpage :
253
Lastpage :
262
Abstract :
Reusing software through copying and pasting is a continuous plague in software development despite the fact that it creates serious maintenance problems. Various techniques have been proposed to find duplicated redundant code (also known as software clones). A recent study has compared these techniques and shown that token-based clone detection based on suffix trees is extremely fast but yields clone candidates that are often no syntactic units. Current techniques based on abstract syntax trees-on the other hand-find syntactic clones but are considerably less efficient. This paper describes how we can make use of suffix trees to find clones in abstract syntax trees. This new approach is able to find syntactic clones in linear time and space. The paper reports the results of several large case studies in which we empirically compare the new technique to other techniques using the Bellon benchmark for clone detectors
Keywords :
abstract data types; programming language semantics; software maintenance; software reusability; trees (mathematics); Bellon benchmark; abstract syntax suffix trees; clone detection; redundant code; software clones; software development; software maintenance; software reusability; syntactic clones; syntactic units; Abstracts; Cloning; Concrete; Detectors; Encoding; Filters; Monitoring; Programming profession; Redundancy; Software maintenance;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Reverse Engineering, 2006. WCRE '06. 13th Working Conference on
Conference_Location :
Benevento
ISSN :
1095-1350
Print_ISBN :
0-7695-2719-1
Type :
conf
DOI :
10.1109/WCRE.2006.18
Filename :
4023995
Link To Document :
بازگشت