Write a Blog >>
PEPM 2017
Mon 16 - Tue 17 January 2017
co-located with POPL 2017
Mon 16 Jan 2017 11:00 - 11:30 at Salle 109, Barre 44-54 - Programming languages Chair(s): Andrew Farmer

Code clones are pairs or groups of code segments which are identical or similar to each other. Generally the existence of code clones is considered to make it cumbersome to maintain the source code, so that various kinds of code clone detection tools have been developed. Simple ones divide the source code into a sequence of lines or tokens and find identical or similar sub-sequences. Differences among code clones, called gaps, may prevent clones from being detected or may make clones to be detected with being fragmented. In order to cope with gaps, various tools have been developed by using abstract syntax trees, comparing some metrics, or using program dependency graphs. In this paper we present a novel algorithm for detecting clones by focusing on gaps with function applications. Based on the algorithm we have implemented a tool for detecting code clones on programs written in Standard ML.

Mon 16 Jan (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

10:30 - 12:00: PEPM 2017 - Programming languages at Salle 109, Barre 44-54
Chair(s): Andrew FarmerFacebook
pepm-workshop10:30 - 11:00
Alejandro SerranoUtrecht University, Jurriaan HageUtrecht University
pepm-workshop11:00 - 11:30
Tsubasa MatsushitaShibaura Institute of Technology, Isao SasanoShibaura Institute of Technology
pepm-workshop11:30 - 12:00
Fritz HengleinDIKU, Denmark, Ulrik Terp RasmussenDIKU, University of Copenhagen