A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Alphabet dependence in parameterized matching
Information Processing Letters
Parameterized pattern matching: algorithms and applications
Journal of Computer and System Sciences
Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
SIAM Journal on Computing
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
CCFinder: a multilinguistic token-based code clone detection system for large scale source code
IEEE Transactions on Software Engineering
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
Multiple Matching of Parameterized Patterns
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Faster algorithms for the construction of parameterized suffix trees
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On finding duplication and near-duplication in large software systems
WCRE '95 Proceedings of the Second Working Conference on Reverse Engineering
Identifying Similar Code with Program Dependence Graphs
WCRE '01 Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01)
Assessing the Benefits of Incorporating Function Clone Detection in a Development Process
ICSM '97 Proceedings of the International Conference on Software Maintenance
Clone Detection Using Abstract Syntax Trees
ICSM '98 Proceedings of the International Conference on Software Maintenance
A Language Independent Approach for Detecting Duplicated Code
ICSM '99 Proceedings of the IEEE International Conference on Software Maintenance
Comparison and Evaluation of Clone Detection Tools
IEEE Transactions on Software Engineering
Towards a mutation-based automatic framework for evaluating code clone detection tools
Proceedings of the 2008 C3S2E conference
Retrieving similar code fragments based on identifier similarity for defect detection
DEFECTS '08 Proceedings of the 2008 workshop on Defects in large software systems
Empirical evaluation of clone detection using syntax suffix trees
Empirical Software Engineering
Remote software protection by orthogonal client replacement
Proceedings of the 2009 ACM symposium on Applied Computing
Comparison and evaluation of code clone detection techniques and tools: A qualitative approach
Science of Computer Programming
Clone detection via structural abstraction
Software Quality Control
Finding similar defects using synonymous identifier retrieval
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
Studying software evolution using artefacts' shared information content
Science of Computer Programming
Parameterized longest previous factor
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Parameterized longest previous factor
Theoretical Computer Science
Active refinement of clone anomaly reports
Proceedings of the 34th International Conference on Software Engineering
Variations of the parameterized longest previous factor
Journal of Discrete Algorithms
Journal of Discrete Algorithms
| Hi-index | 0.00 |
An experiment was carried out by a group of scientists to compare different tools and techniques for detecting duplicated or near-duplicated source code. The overall comparative results are presented elsewhere. This paper takes a closer lookat the results for one tool, Dup, which finds code sections that are textually the same or the same except for systematic substitution of parameters such as identifiers and constants. Varous factors that influenced the results are identified and their impact on the results is assessed via rerunning Dup with changed options and modifications. These improve the performance of Dup with regard to the experiment, and could be incorporated into a postprocessor to be used with other tools.