Proof-directed de-compilation of low-level code

DOI10.1007/3-540-45309-1_23MaRDI QIDQ2763683zbMATH OpenFDO

Authors Shin-ya Katsumata, Atsushi Ohori

Publication date 21 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2028/20280352

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Proof theory in general (including proof-theoretic semantics) (03F03) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of compilers and interpreters (68N20)

Recommendations

• Improved tool support for machine-code decompilation in HOL4
• The logical abstract machine: A Curry-Howard isomorphism for machine code
• Internal models of system F for decompilation
• Function extraction
• A symmetric approach to compilation and decompilation

Cited in

(7)

• From MinX to MinC: semantics-driven decompilation of recursive datatypes
• Verified abstract interpretation techniques for disassembling low-level self-modifying code
• Improved tool support for machine-code decompilation in HOL4
• scientific article; zbMATH DE number 3907745 (Why is no real title available?)
• Function extraction
• A symmetric approach to compilation and decompilation
• Automatic reconstruction of data types in the decompilation problem

This page was built for publication: Proof-directed de-compilation of low-level code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2763683)