Blogs (28) >>
ICFP 2017
Sun 3 - Sat 9 September 2017 Oxford, United Kingdom
Fri 8 Sep 2017 14:25 - 14:50 at L4 - Session 4

As source code dependencies are usually stored in some precompiled executable representation like bytecode, static analysis frameworks for high-level languages have to be specifically adapted so they can meaningfully analyze these libraries too. This adaptation is not trivial, since compilation is in general not injective, the semantics of low-level instruction sets are often not specified adequately, and — as these program representations usually do not support structured programming — the structure of the high-level sources, and the low-level target, is considerably different, like in the case of the functional Erlang programming language and its assembly-like BEAM bytecode. In this paper, we present a structuring algorithm capable of recovering the Erlang syntax tree of functional branching expressions compiled to BEAM, based on certain assumptions regarding the compilation also specified in this paper. This algorithm is intended as a component of a larger framework, that aims to enable the static analysis of Erlang source dependencies by representing the semantics of BEAM programs with an Erlang sytnax tree that can be readily loaded into a static analysis framework.

Fri 8 Sep

14:00 - 14:50: Erlang 2017 - Session 4 at L4
erlang-2017-papers150487200000014:00 - 14:25
Kagumi AzumaKwansei Gakuin University, Nagisa IshiuraKwansei Gakuin University, Nobuaki YoshidaASTEM RI/KYOTO, Hiroyuki KanbaraASTEM RI/KYOTO
erlang-2017-papers150487350000014:25 - 14:50
Dániel LukácsEötvös Loránd University, Melinda Toth