Files in this item

FilesDescriptionFormat

application/pdf

application/pdfVARDISHVILI-THESIS-2019.pdf (546kB)
(no description provided)PDF

Description

Title:Identifying similar code fragments in Haskell
Author(s):Vardishvili, Mariam
Advisor(s):Gunter, Elsa L
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:M.S.
Genre:Thesis
Subject(s):Cloning
Software maintenance
duplicated code
Haskell
Abstract:Identifying syntactically or functionally similar code fragments in source code is an important research 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.
Issue Date:2019-12-13
Type:Text
URI:http://hdl.handle.net/2142/106294
Rights Information:Copyright 2019 Mariam Vardishvili
Date Available in IDEALS:2020-03-02
Date Deposited:2019-12


This item appears in the following Collection(s)

Item Statistics