(Enter summary)
Abstract: We present a proof theoretical method for de-compiling low-level code to the typed lambda calculus. We first define a proof system for a low-level code language based on the idea of Curry-Howard iso-morphism. This allows us to regard an executable code as a proof in intuitionistic propositional logic. As being a proof of intuitionistic logic, it can be translated to an equivalent proof of natural deduction proof system. This property yields an algorithm to translate a given code into a lambda... (Update)
Cited by: More
Transforming Interpreters into Inverse Interpreters by.. - Glück, Kawada, al. (2003)
(Correct)
Active bibliography (related documents): More All
0.3: Normalization by Evaluation for the Computational Lambda-Calculus - Filinski (2001)
(Correct)
0.3: Normalization and Partial Evaluation - Dybjer, Filinski (2002)
(Correct)
0.2: Java Bytecode as a Typed Term Calculus - Higuchi, Ohori (2002)
(Correct)
Similar documents based on text: More All
0.4: Comparing Type-Based and Proof-Directed Decompilation - Mycroft, Ohori, Katsumata (2001)
(Correct)
0.2: Parallel Functional Programming on Recursively Defined Data.. - Nishimura, Ohori (1993)
(Correct)
0.2: Polymorphism and Type Inference in Database Programming - Buneman, Ohori
(Correct)
BibTeX entry: (Update)
S. Katsumata and A. Ohori. Proof-directed de-compilation of Java bytecode. In D. Sands, editor, Programming Languages and Systems. Proceedings, LNCS 2028. http://citeseer.ist.psu.edu/katsumata01proofdirected.html More
@article{ katsumata01proofdirected,
author = "Shin-ya Katsumata and Atsushi Ohori",
title = "Proof-Directed De-compilation of Low-Level Code",
journal = "Lecture Notes in Computer Science",
volume = "2028",
pages = "352--366",
year = "2001",
url = "citeseer.ist.psu.edu/katsumata01proofdirected.html" }
Citations (may not include all citations):
862
The Java Language Specification
- Gosling, Joy et al. - 1996
746
The Java virtual machine specification (context) - Lindholm, Yellin - 1999
566
Proof-carrying code
- Necula, Lee - 1998
415
Efficiently computing static single assignment form and the ..
- Cytron, Ferrante et al. - 1991
201
to typed assembly language (context) - Morrisett, Walker et al. - 1998
169
A type system for Java bytecode subroutines
- Stata, Abadi - 1998
155
The essence of compiling with continuation
- Flanagan, Sabry et al. - 1993
146
Investigation into logical deduction (context) - Gentzen - 1969
116
Natural Deduction (context) - Prawitz - 1965
109
A type system for object initialization in the Java byte cod..
- Freund, Mitchell - 1998
97
Stack-based typed assembly language
- Morrisett, Crary et al. - 1998
96
IEEE Computer Society Press (context) - Working, Reverse et al. - 1993
43
Java Virtual Machine (context) - Meyer, Downing - 1997
32
Normalization as a homomorphic image of cut-elimination (context) - Pottinger - 1977
32
The correspondence between cut-elimination and normalization (context) - Zucker - 1974
29
comprehensive type system for Java bytecode subroutines (context) - O'Callahan, simple - 1999
26
Constructive logics part I: A tutorial on proof systems and ..
- Gallier - 1993
6
The logical abstract machine: a Curry-Howard isomorphism for.. (context) - Ohori - 1999
3
A Curry-Howard isomorphism for compilation and program execu..
- Ohori - 1999
Documents on the same site (http://www.jaist.ac.jp/~ohori/list.html): More
An Equational Object-Oriented Data Model and its.. - Nishimura, Ohori, Tajima (1996)
(Correct)
A Curry-Howard Isomorphism for Compilation and Program Execution.. - Ohori (1999)
(Correct)
A Compilation Method for ML-Style Polymorphic Record Calculi - Ohori (1992)
(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