- VMCAI 2010:
[Slides (ppt)]
This talk is on light weight techniques for integrating set relations (in
addition to aliasing and reachability) to the shape analysis. The
talk includes brief examples of where these relations are useful in
analyzing program updates.
- ISMM 2009:
[Slides (ppt)]
This talk covers the techniques used in the shape analysis to partition
the heap into regions (identify related/recursive data structures)
and has several examples of using this information to support
memory management or GC optimizations.
- PASTE 2008:
[Slides (ppt)]
Introduces a technique for modeling sharing in arrays, collection and between data structures on the heap.
The focus is on the introduction of properties for modeling important classes of sharing without substantial
computational cost.
- PASTE 2007:
[Slides (pdf)]
Introduces a general technique for modeling the pointer contents of generic collection objects. Of particular importance is
the ability to perform strong updates on the contents of a given collection.