Rezumat articol ediţie STUDIA UNIVERSITATIS BABEŞ-BOLYAI

În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului.

 
       
         
    STUDIA INFORMATICA - Ediţia nr.2 din 2018  
         
  Articol:   INCREMENTAL DECOMPILATION OF LOOP-FREE BINARY CODE: ERLANG.

Autori:  GREGORY MORSE, DÁNIEL LUKÁCS, MELINDA TÓTH.
 
       
         
  Rezumat:  
DOI: 10.24193/subbi.2018.2.05

Published Online: 2017-06-19
Published Print: 2017-06-29
pp. 66-87
VIEW PDF: Incremental Decompilation of Loop-Free Binary Code: Erlang

Abstract. 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.
2010 Mathematics Subject Classification. 68W01, 68N20.
1998 CR Categories and Descriptors. code [Computing Methodologies - SYMBOLIC AND ALGEBRAIC MANIPULATION]: Algorithms - Nonalgebraic algorithms; code [Software - PROGRAMMING LANGUAGES]: Processors - Incremental compilers.
Key words and phrases. incremental decompilation, Erlang, dominator tree, post-dominator tree, code duplication.
 
         
     
         
         
      Revenire la pagina precedentă