Introduction to Algorithms
Experiment on the Automatic Detection of Function Clones in a Software System Using Metrics
ICSM '96 Proceedings of the 1996 International Conference on Software Maintenance
Linear Complexity Object-Oriented Similarity for Clone Detection and Software Evolution Analyses
ICSM '04 Proceedings of the 20th IEEE International Conference on Software Maintenance
Comparison and Evaluation of Clone Detection Tools
IEEE Transactions on Software Engineering
Accelerating Compute-Intensive Applications with GPUs and FPGAs
SASP '08 Proceedings of the 2008 Symposium on Application Specific Processors
Computing Structural Types of Clone Syntactic Blocks
WCRE '09 Proceedings of the 2009 16th Working Conference on Reverse Engineering
Fourth International Workshop on Software Clones (IWSC)
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2
Automated type-3 clone oracle using Levenshtein metric
Proceedings of the 5th International Workshop on Software Clones
| Hi-index | 0.00 |
Graphics Processing Unit (GPU) have been around for a while. Although they are primarily used for high-end 3D graphics processing, their use is now acknowledged for general massive parallel computing. This paper presents an original technique based on [10] to compute many instances of the longest common subsequence problem on a generic GPU architecture using classic DP-matching [7]. Application of this algorithm has been found useful to address the problem of filtering false positives produced by metrics-based clone detection methods. Experimental results of this application are presented along with a discussion of possibilities of using GPUs for other cloning related problems.