DocumentCode :
3016427
Title :
Quick Similarity Measurement of Source Code Based on Suffix Array
Author :
Huang Jian-lin ; Li Fei-peng
Author_Institution :
Coll. of Comput. & Software Sci., Shenzhen Univ., Shenzhen, China
Volume :
2
fYear :
2009
fDate :
11-14 Dec. 2009
Firstpage :
308
Lastpage :
311
Abstract :
The automatic similarity measurement of source code can be applied to the detection of both plagiarism and code clone effectively. Suffix array is an effective way to construct the index of the full text, which has showed big applied potential in research areas such as genome analysis and character search currently. This paper introduces the relevant technologies of the similarity measurement of source code, especially the match algorithms for similar source code firstly, and then proposes a quick match algorithm that is applicable for quick similarity measurement of source code based on suffix array. Theory and experiments show that this new match algorithm for similar source code has the same similarity measurement result with current match algorithms, but it has obviously lower running time complexity.
Keywords :
educational technology; software engineering; automatic similarity measurement; code clone detection; genome analysis; match algorithm; plagiarism detection; source code; suffix array; time complexity; Cloning; Computational intelligence; Computer security; Current measurement; Educational institutions; Genomics; Plagiarism; Software maintenance; Software measurement; Space technology; code clone; plagiarism detection; similarity; suffix array;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Security, 2009. CIS '09. International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-5411-2
Type :
conf
DOI :
10.1109/CIS.2009.175
Filename :
5376091
Link To Document :
بازگشت