Towards a Framework for Algorithm Recognition in Binary Code - Université de La Réunion Access content directly
Conference Papers Year : 2016

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.
Fichier principal
Vignette du fichier
ppdp16.pdf (362.75 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01451686 , version 1 (05-11-2018)

Identifiers

  • HAL Id : hal-01451686 , version 1

Cite

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⟩
72 View
189 Download

Share

Gmail Mastodon Facebook X LinkedIn More