Unconditional self-modifying code elimination with dynamic compiler optimizations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Unconditional self-modifying code elimination with dynamic compiler optimizations

Abstract

This paper deals with the issue of self-modifying code and packed programs, a long-standing problem commonly addressed by emulation techniques and memory dumps. We propose an original semantics-based approach to simplify dynamic code analysis, by using compiler optimization techniques to get rid of code-generating instructions. For this, we use classic slicing techniques to identify code dependencies. As it is semantics-based, our approach allows us to rely on strongly established formal methods and is a promising approach for handling packed programs.
Fichier principal
Vignette du fichier
packer.pdf (95.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00538376 , version 1 (22-11-2010)

Identifiers

  • HAL Id : inria-00538376 , version 1

Cite

Isabelle Gnaedig, Matthieu Kaczmarek, Daniel Reynaud, Stéphane Wloka. Unconditional self-modifying code elimination with dynamic compiler optimizations. 5th International Conference on Malicious and Unwanted Software, Fernando C. Colón Osorio, Oct 2010, Nancy, France. ⟨inria-00538376⟩
113 View
657 Download

Share

Gmail Facebook X LinkedIn More