A Ohori. The logical abstract machine: a Curry-Howard isomorphism for machine code. In Proceedings of International Symposium on Functional and Logic Programming, 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... by translation to lambda calculus, or implementation via implementations of lambda calculus such as in [AG98] One can also consider functional programs as lambda expressions (usually in some form of typed lambda calculus) and de ne implementations by translation into rewrite systems, such as in [Oho99]. Reverse compilation can be seen as translating such a rewrite system back into lambda calculus. 2 De nitions 2.1 Basics We assume familiarity with the basic concepts and notations of term rewrite systems. The function symbols of a TRS can be divided into two classes: operators or de ned ....

A. Ohori. The logical abstract machine: A Curry-howard isomorphism for machine code. In 4th Fuji International Symposium on Functional and Logic Programming (FLOPS'99), pages 300-318. Springer, November 1999.

.... by translation to lambda calculus, or implementation via implementations of lambda calculus such as in [1] One can also consider functional programs as lambda expressions (usually in some form of typed lambda calculus) and define implementations by translation into rewrite systems, such as in [12]. Reverse compilation can be seen as translating such a rewrite system back into lambda calculus. 2. DEFINITIONS 2.1. Basics We assume familiarity with the basic concepts and notations of term rewrite systems. SEPARABILITY AND TRANSLATABILITY OF TERM REWRITE SYSTEMS 3 Redex prefix Constructor ....

A. Ohori. The logical abstract machine: A Curry-howard isomorphism for machine code. In 4th Fuji International Symposium on Functional and Logic Programming (FLOPS'99), pages 300--318. Springer, November 1999. 26 BYUN, KENNAWAY, VAN OOSTROM, AND DE VRIES

No context found.

A Ohori. The logical abstract machine: a Curry-Howard isomorphism for machine code. In Proceedings of International Symposium on Functional and Logic Programming, 1999.

No context found.

A. Ohori. The logical abstract machine: a Curry-Howard isomorphism for machine code. In Proc. FLOPS, LNCS 1722, pp 300-318, 1999.

....use type inference to identify overall types for procedures; type inference failures (e.g. occurs check) cause data structures to be reconstructed; inference can then continue. 1.3. The proof directed approach The Katsumata and Ohori [4] approach to decompilation takes as its foundation Ohori s [8] work on the Logical Abstract Machine. This provided a compilation strategy based around transforming from natural deduction (i.e. typed calculus under the Curry Howard correspondence) to the so called sequential sequent calculus (which is very close to machine code) Katsumata and Ohori ....

....the JVM via primitive instructions for accessing and updating object state; proofs for the inference system correspond to programs. For natural reasons the decompilation process described is oriented to JVM with its stack based structure; however Ohori s work on the sequential sequent calculus [8] has both stack machine and register machine instances. 1.4. Comparison framework To aid comparison, we will use a register machine variant of the Katsumata Ohori system instead of the stack machine form presented in [4] Most of the formulation of this can be taken directly from Ohori [8] This ....

[Article contains additional citation context not shown here]

A. Ohori. The Logical Abstract Machine: a CurryHoward Isomorphism for Machine Code. In Proc. 4th Fuji International Symposium on Functional and Logic Programming (FLOPS'99), volume 1722 of Lecture Notes in Computer Science, pages 300--318. Springer-Verlag, 1999.

....Parallel and Distributed Processing Research Consortium, Japan. 1 human readable language. The purpose of this paper is to show that the development of such a system is indeed possible. The key to developing a system of code analysis is a Curry Howard isomorphism for machine code presented in [14]. In this paradigm, a code language corresponds to a variant of the sequent calculus, called the sequential sequent calculus, of the intuitionistic propositional logic. Being a proof system of the logic, it can be translatable to and from other languages corresponding to proof systems of the ....

....lambda term. Section 4 extends this formalism with objects and methods. Section 5 describes the implementation of our prototype de compiler. Section 6 concludes the paper. 2 Logical approach to code analysis In this section, we outline the Curry Howard isomorphism for machine code presented in [14], on which our proof directed de compilation of Java bytecode is based. We let Delta range over a list of formula representing an assumption set of a logical sequent, and write Delta; for the list obtained from Delta by adding . The basic observation underlying the logical interpretation of ....

A Ohori. The logical abstract machine: a Curry-Howard isomorphism for machine code. In Proceedings of International Symposium on Functional and Logic Programming, 1999.

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