kirancodes.me
To Proof Maintenance & Beyond!

Fast and precise points-to analysis with incremental CFL-reachability summarisation: preliminary experience

Lei Shang, Yi Lu, Jingling Xue

Abstract

We describe our preliminary experience in the design and implementation of a points-to analysis for Java, called EMU, that enables developers to perform pointer-related queries in programs undergoing constant changes in IDEs. EMU achieves fast response times by adopting a modular approach to incrementally updating method summaries upon small code changes: the points-to information in a method is summarised indirectly by CFL reachability rather than directly by points-to sets. Thus, the impact of a small code change made in a method is localised, requiring only its affected part to be re-summarised just to reflect the change. EMU achieves precision by being context-sensitive (for both method invocation and heap abstraction) and field-sensitive. Our evaluation shows that EMU can be promisingly deployed in IDEs where the changes are small.

BibTeX
@inproceedings{Shang-al:ASE12,
  author    = {Lei Shang and
               Yi Lu and
               Jingling Xue},
  title     = {Fast and precise points-to analysis with incremental {CFL-reachability} summarisation: preliminary experience},
  booktitle = {ASE},
  pages     = {270--273},
  publisher = {{ACM}},
  year      = {2012},
}

Related papers