Control-flow analysis of dynamic languages via pointer analysis

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We demonstrate how to map a control-flow analysis for a higher-order language (dynamic languages are typically higher-order) 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.

Cite

CITATION STYLE

APA

Lyde, S., Byrd, W. E., & Might, M. (2015). Control-flow analysis of dynamic languages via pointer analysis. ACM SIGPLAN Notices, 51(2), 54–62. https://doi.org/10.1145/2816707.2816712

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free