Home // SOFTENG 2017, The Third International Conference on Advances and Trends in Software Engineering // View article
Authors:
Yoshihisa Udagawa
Keywords: Code clone; Maximal frequent sequence; Longest common subsequence(LCS) algorithm; Java source code
Abstract:
Software clones are introduced to source code by copying and slightly modifying code fragments for reuse. Thus, detection of code clone requires a partial match of code fragments. The essential idea of the proposed approach is a combination of a partial string match using the longest-common-subsequence (LCS) and an apriori-based mining for finding frequent sequences. The novelty of our approach includes the maximal frequent sequences to find the most compact representation of sequential patterns. After outlining the proposed methods, the paper reports on the results of a case study using Java SDK 1.8.0_101 awt graphics package with highlighting the effect analysis on thresholds of the proposed algorithm, i.e., a minimum support and a maximum gap. The results demonstrate the proposed algorithm can detect all possible code clone in the sense that code clone is similar code segments that occur at least twice in source code under consideration.
Pages: 66 to 73
Copyright: Copyright (c) IARIA, 2017
Publication date: April 23, 2017
Published in: conference
ISSN: 2519-8394
ISBN: 978-1-61208-553-1
Location: Venice, Italy
Dates: from April 23, 2017 to April 27, 2017