We demonstrate how to map a control-flow analysis for a higher-order language, which are typically dynamic, into a pointer analysis for a first-order language, such as C. This allows us to use existing pointer analysis tools to perform a control-flow analysis, exploiting their technical advancements and the engineering effort that went into developing them. We compare the results of two recent parallel pointer analysis tools with a parallel control-flow analysis tool. While it has been known that a control-flow analysis of higher-order languages and a pointer analysis of first-order languages are very similar, we demonstrate that these two analyses are actually more similar than previously thought. We present the first mapping between a high-order control flow analysis and a pointer analysis.

Tue 27 Oct
Times are displayed in time zone: Eastern Time (US & Canada) change

10:30 - 12:00: Session 2, Formalization, Semantics, and Static AnalysisDLS at Grand Station 3
10:30 - 10:52
Talk
A Formalization of Typed Lua
DLS
Media Attached
10:52 - 11:15
Talk
Gradual Certified Programming in Coq
DLS
Éric TanterUniversity of Chile, Chile, Nicolas TabareauInria
11:15 - 11:37
Talk
Message Safety in Dart
DLS
Erik Ernst, Mathias SchwarzUber Aarhus, Fabio StroccoAarhus University, Denmark, Anders MøllerAarhus University
11:37 - 12:00
Talk
Control-Flow Analysis of Dynamic Languages via Pointer Analysis
DLS
Steven Lyde, Matthew MightUniversity of Utah, USA, William E. Byrd