An Approach to the Problem of Detranslation of Computer Programs | Zendy

R. Nigel Horspool | Zendy; Nenad Marovac | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Approach to the Problem of Detranslation of Computer Programs

Author(s) -

R. Nigel Horspool,

Nenad Marovac

Publication year - 1980

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/23.3.223

Subject(s) - executable , computer science , programming language , identification (biology) , code (set theory) , theoretical computer science , software engineering , botany , set (abstract data type) , biology

A crucial problem in the decompilation or disassembly of computer programs is the identification of executable code, i.e. the separation of instructions from data. This problem, for most computer architectures, is equivalent to the Halting Problem and is therefore unsolvable in general. The problem of identifying instructions is examined in this paper and an algorithm that will 'usually' perform a correct analysis is described. In addition, other aspects of disassembly are discussed and algorithms outlined. (Received October 1978; revised May 1979)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research