Jens Krinke

TL;DR: An experiment is presented that evaluates six clone detectors based on eight large C and Java programs (altogether almost 850 KLOC) and selects techniques that cover the whole spectrum of the state-of-the-art in clone detection.

TL;DR: This approach to identifying similar code in programs based on finding similar subgraphs in attributed directed graphs considers not only the syntactic structure of programs but also the data flow within (as an abstraction of the semantics).

TL;DR: The study observes that when there are inconsistent changes to a code clones group in a near version, it is rarely the case that there are additional changes in later versions such that the code clone group then has only consistent changes.

Abstract: Clone detection finds application in many software engineering activities such as comprehension and refactoring. However, the confounding configuration choice problem poses a widely-acknowledged threat to the validity of previous empirical analyses. We introduce desktop and parallelised cloud-deployed versions of a search based solution that finds suitable configurations for empirical studies. We evaluate our approach on 6 widely used clone detection tools applied to the Bellon suite of 8 subject systems. Our evaluation reports the results of 9.3 million total executions of a clone tool; the largest study yet reported. Our approach finds significantly better configurations (p

TL;DR: This paper extends the well known structures of the control flow graph and the program dependencc graph for threaded programs with interference and calculates more precise static slices which does not require serialization of threaded programs.