Identifying similar code fragments in Haskell

Cloning;Software maintenance;duplicated code;Haskell

Vardishvili, Mariam ; Gunter ; Elsa L

关键词: Cloning;    Software maintenance;    duplicated code;    Haskell;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/106294/VARDISHVILI-THESIS-2019.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

Identifying syntactically or functionally similar code fragments in source code is an importantresearch question in software engineering. Many researchers pointed out that detecting and refactoring code clones can be beneficial for software maintenance purposes.This work presents a clone detector algorithm. The proposed approach uses a source code AST representation and identifies similar fragments by generating and filtering pattern trees created from subtree pairs. The algorithm extends the existing technique of tree comparison by including Munkers assignment algorithm (The Hungarian method) and the longest common subsequence algorithm. Munkres assignment algorithm helps to identify rearranged code fragments. The LCS algorithm is used to compare subtrees of different syntactic variants. Experiments showed that these algorithms can help better evaluate code fragments to identify duplicates.