Title :
Comparing type-based and proof-directed decompilation
Author :
Mycroft, Alan ; Ohori, Atsushi ; Katsumata, Shin-ya
Author_Institution :
Comput. Lab., Cambridge Univ., UK
fDate :
6/23/1905 12:00:00 AM
Abstract :
In the past couple of years interest in decompilation has widened from its initial concentration on reconstruction of control flow into well-founded-in-theory methods to reconstruct type information. A. Mycroft (1999) described Type-Based Decompilation and S. Katsumata and A. Ohori (2001) described Proof-Directed Decompilation. The article summarises the two approaches and identifies their commonality, strengths and weaknesses; it concludes by suggesting how they may be integrated
Keywords :
program compilers; theorem proving; type theory; Proof-Directed Decompilation; Type-Based Decompilation; control flow reconstruction; type information; well-founded-in-theory methods; Assembly; Calculus; Computer science; Data mining; Information science; Intellectual property; Internet telephony; Laboratories; Logic; Web server;
Conference_Titel :
Reverse Engineering, 2001. Proceedings. Eighth Working Conference on
Conference_Location :
Stuttgart
Print_ISBN :
0-7695-1303-4
DOI :
10.1109/WCRE.2001.957844
