HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Towards a Framework for Algorithm Recognition in Binary Code

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download

Contributor : Réunion Univ Connect in order to contact the contributor
Submitted on : Monday, November 5, 2018 - 9:52:59 AM
Last modification on : Wednesday, November 3, 2021 - 6:02:27 AM
Long-term archiving on: : Wednesday, February 6, 2019 - 2:55:30 PM


Files produced by the author(s)


  • HAL Id : hal-01451686, version 1



Frédéric Mesnard, Etienne Payet, Wim Vanhoof. Towards a Framework for Algorithm Recognition in Binary Code. 18th International Symposium on Principles and Practice of Declarative Programming (PPDP), Sep 2016, Edinburgh, United Kingdom. pp.202--213. ⟨hal-01451686⟩



Record views


Files downloads