지역정렬 알고리즘을 기반으로한 동시성 코드 복제검출

Abstract

The code clone is usually referred to as a code fragment that is identical or near-identical to another. Clones appear in source code because of various reasons such as reusing code, "copy/past", or intentional code repetition for performance enhancement, etc. The presence of code clones makes the maintenance process more complicated. For example, when a bug is found and a code fragment including the bug is modified, it is necessary to determine whether or not each code clone in the same clone set has to be modified. It is likely to overlook some of them. Thus, it is important to have a feature for searching the code clones of a specified code fragment. This research work is focused on a distributive algorithm of an existing token-based clone detection technique. Dynamic programming is basic building block of my proposed reforms for algorithm. Score table is developed using dynamic programming for code clone detection, which further divides table into blocks. This work also explores the efficiency and multiple computations dynamics in clone detection technique. The results concluded that the concurrent algorithm was effective and it solved time and space limitations on local alignment algorithm.