Cloneless: Code Clone Detection via Program Dependence Graphs with Relaxed Constraints

<p>Code clones are pieces of code that have the same functionality. While some clones may structurally match one another, others may look drastically different. The inclusion of code clones clutters a code base, leading to increased costs through maintenance. Duplicate code is introduced through a variety of means, such as copy-pasting, code generated by tools, or developers unintentionally writing similar pieces of code. While manual clone identification may be more accurate than automated detection, it is infeasible due to the extensive size of many code bases. Software code clone detection methods have differing degree of success based on the analysis performed. This thesis outlines a method of detecting clones using a program dependence graph and subgraph isomorphism to identify similar subgraphs, ultimately illuminating clones. The project imposes few constraints when comparing code segments to potentially reveal more clones.</p>

Name thesis:degree_name

MS in Computer Science

Discipline thesis:degree_discipline

Computer Science

Year dc:date.available

2019

Author dc:creator

• Simko, Thomas J

Contributors dc:contributor

• Aaron Keen

• Code Clone
• Program Dependence Graph
• PDG
• Duplicate
• Code
• Clone
• Detection
• Computational Engineering

Identifier

10.15368/theses.2019.41

OAI identifier oai:identifier

oai:digitalcommons.calpoly.edu:theses-3437