Comparing type-based and proof-directed decompilation

Reverse Engineering - Working Conference Proceedings

Volumn , Issue , 2001, Pages 362-367

  Mycroft, A ^a   Ohori, A ^a   Katsumata, S Y ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COBOL (PROGRAMMING LANGUAGE); DATA FLOW ANALYSIS; GRAPHICAL USER INTERFACES; INTELLECTUAL PROPERTY; LEGACY SYSTEMS;

DECOMPILATION;

INFORMATION ANALYSIS;

EID: 0034775346     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. SSA is functional programming
2. Efficiently computing static single assignment form and the control dependence graph
3. Proof-directed decompilation of low-level code
4. Type analysis of logic programs in the presence of type definitions
5. A polymorphic type analysis in logic programs by abstract interpretation
6. Type-based decompilation
7. The logical abstract machine: A curry-howard isomorphism for machine code