University of Cambridge > > Computer Laboratory Programming Research Group Seminar > Title to be confirmedFlow- and Context-Sensitive Points-to Analysis using Generalized Points-to Graphs

Title to be confirmedFlow- and Context-Sensitive Points-to Analysis using Generalized Points-to Graphs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Alan Mycroft.

Many program analysis benefit from knowledge of aliasing or points-to information. Computing precise (FCPA, fully flow-sensitive and context-sensitive) and exhaustive (as against demand-driven) points-to information is known to be computationally expensive. Therefore many practical tools approximate the points-to information trading precision for efficiency. This often has an adverse impact on computationally intensive analyses such as model checking.

Previous approaches to FCPA (either top-down, or bottom-up using placeholders to explicate unknown locations or by using multiple call-specific summary flow functions) do not scale in practice. We adopt a traditional approach (constructing bottom-up procedure summaries) involving pointers but use a novel representation of procedure summaries: the generalized points-to graph (GPG); these leave unknown locations implicit.

By design, GPGs represent both memory (in terms of classical points-to facts) and memory transformers (in terms of generalized points-to facts). We perform FCPA by progressively reducing generalized points-to facts to classical points-to facts. GPGs distinguish between may and must pointer updates thereby facilitating strong updates within calling contexts. The number of nodes in the GPG for a procedure is linearly bounded by the number of variables and is independent of the number of statements in the procedure. Empirical measurements on SPEC benchmarks show that GPGs are indeed compact in spite of large procedure sizes and scale to programs of up to 158kLoC.

This talk is part of the Computer Laboratory Programming Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2021, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity