Improving flow analyses via γCFA abstract garbage collection and counting

Academic Article

Abstract

  • We present two independent and complementary improvements for flow-based analysis of higher-order languages: (1) abstract garbage collection and (2) abstract counting, collectively titled ΓCFA. Abstract garbage collection is an analog to its concrete counterpart: we determine when an abstract resource has become unreachable, and then reallocate it as fresh. This prevents flow sets from merging in the abstract, which has two immediate effects: (1) the precision of the analysis is increased, and (2) the running time of the analysis is frequently reduced. In some nontrivial cases, we achieve an order of magnitude improvement in precision and time simultaneously. In abstract counting, we track 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, in turn, allows us to perform environment analysis and to expand the kinds (rather than just the degree) of optimizations available to the compiler. Copyright © 2006 ACM.
  • Authors

    Published In

    Digital Object Identifier (doi)

    Pubmed Id

  • 23497272
  • Author List

  • Might M; Shivers O
  • Start Page

  • 13
  • End Page

  • 25
  • Volume

  • 41
  • Issue

  • 9