From: tmoran@acm.org
Subject: Re: Reverse engineering Ada's compiled code
Date: Fri, 15 Mar 2013 15:47:46 +0000 (UTC)
Date: 2013-03-15T15:47:46+00:00 [thread overview]
Message-ID: <khvfr2$hf4$1@speranza.aioe.org> (raw)
In-Reply-To: 90bf1e05-3a48-498b-96f4-b16569c40618@googlegroups.com
>I have quite an unusual question to ask: how difficult would it be to
>reverse engineer Ada's compiled code? I am sure this question must have
J.S. Donnelly, "A Decompiler for the Countess Computer," Navy
Electronics Laboratory Technical Memorandum 427, Sept. 1960
It decompiled to Neliac, an Algol 58 derived language, and was intended
to take lots of the machine coded programs of the time and turn them into
Neliac, which could then be understood, modified, and compiled to other
targets. Decompilation is a pattern recognition problem and its
difficulty depends on how complex and varied are the patterns to be
recognized. If you just have a modest amount of machine code, manual
decompilation would be easier.
Assisting on that project as a work-study student was my introduction to
programming. A very good introduction to both the high-level and the
machine level language.
next prev parent reply other threads:[~2013-03-15 15:47 UTC|newest]
Thread overview: 4+ messages / expand[flat|nested] mbox.gz Atom feed top
2013-03-15 13:14 Reverse engineering Ada's compiled code Dufr
2013-03-15 15:35 ` Gautier write-only
2013-03-15 15:47 ` tmoran [this message]
2013-03-16 1:28 ` wilson
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox