Talks

• 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.
  

• CC 2008: [Slides (pdf)]
  Covers the project/extend (frame-rule) operations in the heap model domain. In particular how cutpoints are named and how to minimize the information that is lost when collisions between the cutpoint names occurs. Examples are focused on providing intuition into why cutpoints are useful and how they work in a non-trivial heap.
  

• 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.
  

• DaCapo 2007: [Slides (pdf)]
  A second talk on the basic design of Model Theoretic Shape Analysis (MTSA). It covers the some of the basic definitions focusing on the motivating optimization applications. This talk also has a detailed example of reversing a linked list and a discussion of using the analysis results to optimize the em3d application.
  

• LCPC 2006: [Slides (pdf)]
  This is the first talk on the Model Theoretic Shape Analysis (MTSA). It covers the some of the basic definitions as well as provides a detailed example of copying a linked list.