[llvm-dev] Decompilation and the SSA form

[Carter Cheng via llvm-dev]

Hi,

Is decompilation possible in general to the SSA form for binaries? I assume
one has to make certain assumptions about code in general to get tools like
these to work. For example if code like with dlsym or jit heap allocated
functions can be incorporated at runtime it would seem that in general it
is quite difficult to ascertain the boundaries of a basic block and insert
the correct phi functions for the predecessors since one could have jumps
from the new code into the middle of the static code. This is already
ignoring the problem of self modification.

I haven't managed to find many references on the topic but I am curious
about what sorts of assumptions are made in decompilation code recovery and
general issues theoretical issues about when it is possible to do.

Thanks in advance,

Carter,
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20160123/4747a91e/attachment.html>