Conference Papers Year : 2014

Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code

Abstract

Static analysis of binary code is challenging for several reasons. In particular, standard static analysis techniques operate over control flow graphs, which are not available when dealing with self-modifying programs which can modify their own code at runtime. We formalize in the Coq proof assistant some key abstract interpretation techniques that automatically extract memory safety properties from binary code. Our analyzer is formally proved correct and has been run on several self-modifying challenges, provided by Cai et al. in their PLDI 2007 paper.
Fichier principal
Vignette du fichier
itp14.pdf (192) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01102445 , version 1 (12-01-2015)

Identifiers

Cite

Sandrine Blazy, Vincent Laporte, David Pichardie. Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code. The 5th International Conference on Interactive Theorem Proving (ITP 2014), 2014, Vienna, Austria. pp.128 - 143, ⟨10.1007/978-3-319-08970-6_9⟩. ⟨hal-01102445⟩
375 View
255 Download

Altmetric

Share

More