Semantic Code Clones in Logic Programs

Dandois, Céline; Vanhoof, Wim

doi:10.1007/978-3-642-38197-3_4

Cited by 4 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We are now in a position to define algorithmic equivalence, which we define with respect to the combination of a program, a predicate, and a sequence of argument positions. The definition is loosely based on the notion of a semantic clone pair (Dandois and Vanhoof 2012).…”

Section: Structural Equivalencementioning

confidence: 99%

Towards a framework for algorithm recognition in binary code

Mesnard

Payet

Vanhoof

2016

Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

Algorithm recognition, which is the problem of verifying whether a program implements a given algorithm, is an important topic in program analysis. We propose an approach for algorithm recognition in binary code. For this paper, we have chosen the Dalvik Virtual Machine (DVM) bytecode. Given an algorithm A that is compiled into a DVM method M0, and a DVM program P that includes a series of methods {M1,. .. , Mn}, the approach is able to identify those blocks Mi from P that essentially implement the algorithm A. The technique we propose first translates binary code into Horn clauses. Then we consider programs as implementing the same algorithm if their Horn clause representations can be reduced to a single common set of Horn clauses by means of a sequence of transformations.

show abstract

Section: Structural Equivalencementioning

confidence: 99%