The students will be divided into groups of three/four and each group has to a) choose a paper to lead, b) write a two page summary, c) present the paper. Each group can work together in reading, writing the summaries and preparing their presentations. One student from the lead group will be chosen at random to present their paper (main presentation). They will get exactly 30 minutes to present the paper. After the main presentation, some of the non-lead groups will be asked to make a short ten minutes (at most 2-3 slides) presentation to summarize their own findings/understanding. For each group, their lead presentation will count for sixty percent of the marks, the summary presentations will be count towards thirty percent of the marks, and ten percent of the mark for class participation.


List of papers to choose from. If you want to present a paper not in this list, then contact the instructor.

  1. Incrementalized Pointer and Escape Analysis, Frederic Vivien and Martin C. Rinard, PLDI 2001.
  2. Register Allocation via Coloring of Chordal Graphs, Fernando MQ Pereira and Jens Palsberg, APLAS 2005.
  3. Parallel Replication-Based Points-To Analysis Sandeep Putta and Rupesh Nasre, CC 2012.
  4. Parallel Inclusion Based Points-To Analysis Mario Mendez-Lojo, Augustine Mathew and Keshav Pingali, OOPSLA 2010.
  5. Accurate Interprocedural Null-Dereference Analysis for Java Mangala Gowri Nanda and Saurabh Sinha, ICSE 2009.
  6. Techniques for efficient placement of synchronization primitives Alexandru Nicolau, Guangqiang Li and Arun Kejariwal, PPOPP 2009.


Expecting that we will have four groups, the slots for presentation are:
Nov 8 2013: 3-4pm, 4-5pm.
Nov 13 2013: 2-3pm, 3-4pm.