Linear Complexity Object-Oriented Similarity for Clone Detection and Software Evolution Analyses

Authors:
E. Merlo;G. Antoniol;M. Di Penta;V. F. Rollo
Affiliations:
École Polytechnique de Montréal;University of Sannio;University of Sannio;University of Sannio
Venue:
ICSM '04 Proceedings of the 20th IEEE International Conference on Software Maintenance
Year:
2004

Citing 0
Cited 6

An empirical study of code clone genealogies

Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
On feature traceability in object oriented programs

TEFSE '05 Proceedings of the 3rd international workshop on Traceability in emerging forms of software engineering
A novel approach to optimize clone refactoring activity

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Comparison and evaluation of code clone detection techniques and tools: A qualitative approach

Science of Computer Programming
Challenging cloning related problems with GPU-based algorithms

Proceedings of the 4th International Workshop on Software Clones
Automated type-3 clone oracle using Levenshtein metric

Proceedings of the 5th International Workshop on Software Clones

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the widespread adoption of object-oriented technologies, the lack of computationally efficient and scalable approaches is limiting the ability to model and analyze the history of large object-oriented software systems. This paper proposes an approximate representation of object-oriented code characteristics, inspired by pattern recognition centroids for clustering. An interesting application of such a representation is a linear-time complexity algorithm to detect duplicate or nearly duplicated code in object-oriented systems. The algorithm accuracy and time complexity were assessed on 11 releases of a large software system, the Eclipse Framework.