A computability perspective on self-modifying programs - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

A computability perspective on self-modifying programs

(1) , (1) , (1)
1

Abstract

In order to increase their stealth, malware com- monly use the self-modification property of programs. By doing so, programs can hide their real code so that it is difficult to define a signature for it. But then, what is the meaning of those programs: the obfuscated form, or the hidden one? Furthermore, from a computability perspective, it becomes hard to speak about the program since, its own code varies over time. To cope with these issues, we provide an operational semantics for self-modifying programs and we show that they can be constructively rewritten to a non-modifying program.
Fichier principal
Vignette du fichier
automodificateur.pdf (153.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00433472 , version 1 (19-11-2009)

Identifiers

  • HAL Id : inria-00433472 , version 1

Cite

Guillaume Bonfante, Jean-Yves Marion, Daniel Reynaud. A computability perspective on self-modifying programs. 7th IEEE International Conference on Software Engineering and Formal Methods - SEFM 2009, Nov 2009, Hanoi, Vietnam. ⟨inria-00433472⟩
163 View
820 Download

Share

Gmail Facebook Twitter LinkedIn More