期刊名称：Studia Universitatis Babes-Bolyai : Series Informatica
印刷版ISSN：1224-869X
出版年度：2018
卷号：63
期号：2
页码：1-22
DOI：10.24193/subbi.2018.2.05
出版社：Babes-Bolyai University, Cluj-Napoca
摘要：Decompiling byte code to a human readable format is an important
research field. A proper decompiler can be used to recover lost
source code, helps in different reverse engineering tasks and also enhances
static analyzer tools by refining the calculated static semantic information.
In an era with a lot of advancement in areas such as incremental algorithms
and boolean satisfiability (SAT) solvers, the question of how to properly
structure a decompilation tool to function in a completely incremental
manner has remained an interesting problem.
This paper presents a concise algorithm and structuring design pattern
for byte code which has a loop-free representation, as is seen in the
Erlang language. The algorithms presented in this paper were implemented
and verified during the decompilation of the Erlang/OTP library.
