• DocumentCode
    1665136
  • Title

    Comparing type-based and proof-directed decompilation

  • Author

    Mycroft, Alan ; Ohori, Atsushi ; Katsumata, Shin-ya

  • Author_Institution
    Comput. Lab., Cambridge Univ., UK
  • fYear
    2001
  • fDate
    6/23/1905 12:00:00 AM
  • Firstpage
    362
  • Lastpage
    367
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Reverse Engineering, 2001. Proceedings. Eighth Working Conference on
  • Conference_Location
    Stuttgart
  • ISSN
    1095-1350
  • Print_ISBN
    0-7695-1303-4
  • Type

    conf

  • DOI
    10.1109/WCRE.2001.957844
  • Filename
    957844
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1665136