Show simple item record

dc.contributor.authorGreen, Pamela
dc.contributor.authorLane, Peter
dc.contributor.authorScholz, Sven-Bodo
dc.contributor.authorRainer, Austen
dc.date.accessioned2011-08-10T08:01:11Z
dc.date.available2011-08-10T08:01:11Z
dc.date.issued2010
dc.identifier.citationGreen , P , Lane , P , Scholz , S-B & Rainer , A 2010 , Unscrambling code clones for one-to-one matching of duplicated code . UH Computer Science Technical Report , vol. 502 , University of Hertfordshire .
dc.identifier.otherPURE: 249078
dc.identifier.otherPURE UUID: 132e838e-2484-4f0b-af49-f1284e058f0e
dc.identifier.urihttp://hdl.handle.net/2299/6129
dc.description.abstractCode clone detection tools find sections of code that are similar. Different tools use difference representations of the code and different matching algorithms. This diversity makes clone detection tools attractive for other code matching tasks, particularly where code has been edited or rearranged. However, the tools report on every match found. In some applications we are interested in one-to-one matching, meaning that each section of copied code in one file is matched to just one section of code in the other file. In this report we explore ways that clones reported by the detection tools can inflate the amount of matching code. We also explain, with the aid of a worked example, our method for unscrambling the output from clone detection tools to approximate one-to-one matching if the code in one file to that in another file.en
dc.language.isoeng
dc.publisherUniversity of Hertfordshire
dc.relation.ispartofseriesUH Computer Science Technical Report
dc.subjectclone detection
dc.titleUnscrambling code clones for one-to-one matching of duplicated codeen
dc.contributor.institutionScience & Technology Research Institute
dc.contributor.institutionSchool of Computer Science
rioxxterms.versionAM
rioxxterms.typeOther
herts.preservation.rarelyaccessedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record