(Enter summary)
Abstract: We describe a system which decompiles (reverse engineers) C programs from target
machine code by type-inference techniques. This extends recent trends in the converse
process of compiling high-level languages whereby type information is preserved during
compilation. The algorithms remain independent of the particular architecture by virtue
of treating target instructions as register-transfer specifications. Target code expressed
in such RTL form is then transformed into SSA form (undoing... (Update)
Cited by: More
CodeSurfer/x86---A Platform for Analyzing x86 - Executables Gogul Balakrishnan
(Correct)
Recovery of Variables and Heap Structure in x86 Executables - Gogul Balakrishnan Bgogul
(Correct)
Intermediate-Representation Recovery from Low-Level Code - Thomas Reps Gogul
(Correct)
Similar documents (at the sentence level):
46.7%: Type-Based Decompilation - Mycroft (1999)
(Correct)
Active bibliography (related documents): More All
0.3: Geometric Model Checking: An Automatic.. - Shashidhar.. (2002)
(Correct)
0.2: Generalizing Hindley-Milner Type Inference Algorithms - Heeren, Hage, Swierstra (2002)
(Correct)
0.2: Incremental Polymorphic Type Checking With Update - Mycroft (1992)
(Correct)
Similar documents based on text: More All
0.3: Comparing Type-Based and Proof-Directed Decompilation - Mycroft, Ohori, Katsumata (2001)
(Correct)
0.0: σ-SSA and its Construction through Symbolic.. - Saito, Polychronopoulos (1996)
(Correct)
0.0: Extended SSA Numbering: Introducing SSA Properties to.. - Lapkowski, Hendren (1996)
(Correct)
Related documents from co-citation: More All
6: Assembly to high-level language translation
- Cifuentes, Simon et al. - 1998
6: Alias Analysis of Executable Code
- Debray, Muth et al. - 1998
5: Abstract interpretation based certification of assembly code (context) - Rival - 2003
BibTeX entry: (Update)
A. Mycroft. Type-based decompilation. In S. D. Swierstra, editor, ESOP'99 - European Symposium On Programming, Lecture Notes in Computer Science. Springer, 1999. http://citeseer.ist.psu.edu/article/mycroft98typebased.html More
@article{ mycroft99typebased,
author = "A. Mycroft",
title = "Type-Based Decompilation",
journal = "Lecture Notes in Computer Science",
volume = "1576",
pages = "208--??",
year = "1999",
url = "citeseer.ist.psu.edu/article/mycroft98typebased.html" }
Citations (may not include all citations):
415
Efficiently computing static single assignment form and the ..
- Cytron, Ferrante et al. - 1991
10
BCPL---The Language and its Compiler (context) - Richards, Whitby-Strevens - 1979
6
on Principles of Programming Languages (context) - Morrisett, Walker et al. - 1998
5
A Theory of Polymorphism in Programming (context) - Milner - 1978
5
Correcting Errors in the Curry System (context) - Gandhe, Venkatesh et al. - 1996
3
on Programming Language Design and Implementation (context) - Necula, Lee et al. - 1998
2
Diploma in Computer Science Dissertation (context) - Glasscock, An et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.disi.unige.it/conferences/appsem98/proceedings/): More
Lazy Computation with Exact Real Numbers - Edalat, Potts, Sünderhauf (1998)
(Correct)
Realizability Models for Sequential Computation - Longley (1998)
(Correct)
General Synthetic Domain Theory - A Logical Approach - Reus, Streicher (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC