Exploiting reachability and cardinality in higher-order flow analysis

10Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

We present two complementary improvements for abstract-interpretation-based flow analysis of higher-order languages: (1) abstract garbage collection and (2) abstract counting. Abstract garbage collection is an analog to its concrete counterpart: the analysis determines when an abstract resource has become unreachable, and then, re-allocates it as fresh. This prevents flow sets from joining during abstract interpretation, which has two immediate effects: (1) the precision of the interpretation increases and (2) its running time often falls. In abstract counting, the analysis tracks how many times an abstract resource has been allocated. A count of one implies that the abstract resource momentarily represents only one concrete resource. This knowledge, in turn, drives environment analysis, expanding the kind (rather than just the degree) of optimization available to the compiler. © 2008 Cambridge University Press.

Cite

CITATION STYLE

APA

Might, M., & Shivers, O. (2008). Exploiting reachability and cardinality in higher-order flow analysis. In Journal of Functional Programming (Vol. 18, pp. 821–864). https://doi.org/10.1017/S0956796808006941

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