Skip to main content
Conference Proceedings

An algorithm for sophisticated code matching in logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5366 LNCS 785-789
DOI: 10.1007/978-3-540-89982-2_77
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Vanhoof, W., & Degrave, F. (2008). An algorithm for sophisticated code matching in logic programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5366 LNCS, pp. 785–789). https://doi.org/10.1007/978-3-540-89982-2_77

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free