Skip to Main content Skip to Navigation
Conference papers

A computability perspective on self-modifying programs

Guillaume Bonfante 1 Jean-Yves Marion 1 Daniel Reynaud 1
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
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.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/inria-00433472
Contributor : Guillaume Bonfante <>
Submitted on : Thursday, November 19, 2009 - 2:39:28 PM
Last modification on : Tuesday, December 18, 2018 - 4:48:02 PM
Document(s) archivé(s) le : Tuesday, October 16, 2012 - 2:25:55 PM

File

automodificateur.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00433472, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

399

Files downloads

546