An Algorithm for Sophisticated Code Matching in Logic Programs

Authors:
Wim Vanhoof;François Degrave
Affiliations:
Faculty of Computer Science, University of Namur, Namur, Belgium B-5000;Faculty of Computer Science, University of Namur, Namur, Belgium B-5000
Venue:
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Year:
2008

Citing 8
Cited 1

Identifying the semantic and textual differences between two versions of a program

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Identifying syntactic differences between two programs

Software—Practice & Experience
Refactoring: improving the design of existing code

Refactoring: improving the design of existing code
A Survey of Longest Common Subsequence Algorithms

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Winnowing: local algorithms for document fingerprinting

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Improving prolog programs: Refactoring for prolog

Theory and Practice of Logic Programming
Towards a Normal Form for Mercury Programs

Logic-Based Program Synthesis and Transformation
Searching semantically equivalent code fragments in logic programs

LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation

Clones in logic programs and how to detect them

LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work in progress, we develop a program analysis capable of efficiently detecting duplicated functionality within a logic program or a set of logic programs. Our main motivation is to provide an analysis that allows to automatically spot those locations in a program where a transformation could be applied that removes the duplication from the source code.