TY - JOUR AU - Morse, G. AU - Lukacs, D. AU - Toth, M. PY - 2018/06/19 TI - Incremental Decompilation of Loop-Free Binary Code: Erlang JF - Studia Universitatis BabeČ™-Bolyai Informatica; Vol 63 No 2 (2018)DO - 10.24193/subbi.2018.2.05 KW - N2 - 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. UR - https://www.cs.ubbcluj.ro/~studia-i/journal/journal/article/view/29