INCREMENTAL DECOMPILATION OF LOOP-FREE BINARY CODE: ERLANG
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Babes-Bolyai University, Cluj-Napoca
2018-12-01
|
| Series: | Studia Universitatis Babes-Bolyai: Series Informatica |
| Subjects: | |
| Online Access: | http://193.231.18.162/index.php/subbinformatica/article/view/4143 |
| _version_ | 1827356559574827008 |
|---|---|
| author | Gregory MORSE Dániel LUKÁCS Melinda TÓTH |
| author_facet | Gregory MORSE Dániel LUKÁCS Melinda TÓTH |
| author_sort | Gregory MORSE |
| collection | DOAJ |
| description |
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.
|
| first_indexed | 2024-03-08T05:10:35Z |
| format | Article |
| id | doaj.art-cb2eeacbda314023bd9860dd1a6a95fe |
| institution | Directory Open Access Journal |
| issn | 2065-9601 |
| language | English |
| last_indexed | 2024-03-08T05:10:35Z |
| publishDate | 2018-12-01 |
| publisher | Babes-Bolyai University, Cluj-Napoca |
| record_format | Article |
| series | Studia Universitatis Babes-Bolyai: Series Informatica |
| spelling | doaj.art-cb2eeacbda314023bd9860dd1a6a95fe2024-02-07T10:03:44ZengBabes-Bolyai University, Cluj-NapocaStudia Universitatis Babes-Bolyai: Series Informatica2065-96012018-12-0163210.24193/subbi.2018.2.05INCREMENTAL DECOMPILATION OF LOOP-FREE BINARY CODE: ERLANGGregory MORSE0Dániel LUKÁCS1Melinda TÓTH2Eötvös Loránd University. Email: morse@inf.elte.huEötvös Loránd University, Budapest, Hungary. Email: dlukacs@caesar.elte.huEötvös Loránd University, Budapest, Hungary. Email: tothmelinda@caesar.elte.hu 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. http://193.231.18.162/index.php/subbinformatica/article/view/4143incremental decompilation, Erlang, dominator tree, post-dominator tree, code duplication. |
| spellingShingle | Gregory MORSE Dániel LUKÁCS Melinda TÓTH INCREMENTAL DECOMPILATION OF LOOP-FREE BINARY CODE: ERLANG Studia Universitatis Babes-Bolyai: Series Informatica incremental decompilation, Erlang, dominator tree, post-dominator tree, code duplication. |
| title | INCREMENTAL DECOMPILATION OF LOOP-FREE BINARY CODE: ERLANG |
| title_full | INCREMENTAL DECOMPILATION OF LOOP-FREE BINARY CODE: ERLANG |
| title_fullStr | INCREMENTAL DECOMPILATION OF LOOP-FREE BINARY CODE: ERLANG |
| title_full_unstemmed | INCREMENTAL DECOMPILATION OF LOOP-FREE BINARY CODE: ERLANG |
| title_short | INCREMENTAL DECOMPILATION OF LOOP-FREE BINARY CODE: ERLANG |
| title_sort | incremental decompilation of loop free binary code erlang |
| topic | incremental decompilation, Erlang, dominator tree, post-dominator tree, code duplication. |
| url | http://193.231.18.162/index.php/subbinformatica/article/view/4143 |
| work_keys_str_mv | AT gregorymorse incrementaldecompilationofloopfreebinarycodeerlang AT daniellukacs incrementaldecompilationofloopfreebinarycodeerlang AT melindatoth incrementaldecompilationofloopfreebinarycodeerlang |