Control-Flow Analysis of Dynamic Languages via Pointer Analysis
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
|A Formalization of Typed Lua|
|Gradual Certified Programming in Coq|
|Message Safety in Dart|
|Control-Flow Analysis of Dynamic Languages via Pointer Analysis|