Lead presentation: Each student will have to (a) choose two-papers one paper to lead, (b) write a two page summary, (c) present the paper. For the main presentation each student will get exactly 30 minutes.

Side presentation: After the main presentation, some of remaining students will be asked to make a short (max) ten minutes (at most 2-3 slides) presentation to summarize their own findings/understanding, along with possible future work.

For each student, their lead presentation will count for ten marks, the summary presentations will be count towards three marks, and two marks for class participation. Schedule of presentations:
  1. 22-Apr-2020: Gokulan: Points-to analysis in almost linear time Bjarne Steensgaard, POPL 1996.
  2. 23-Apr-2020: Ramya : Incrementalized Pointer and Escape Analysis, Frederic Vivien and Martin C. Rinard, PLDI 2001.
  3. 27-Apr-2020: Arjun : Accurate Interprocedural Null-Dereference Analysis for Java Mangala Gowri Nanda and Saurabh Sinha, ICSE 2009.
  4. 29-Apr-2020: Shivam: Automatic Generation of Peephole Superoptimizers Sorav Bansal and Alex Aiken, ASPLOS 2006.
  5. 30-Apr-2020: Rochak: Techniques for efficient placement of synchronization primitives Alexandru Nicolau, Guangqiang Li and Arun Kejariwal, PPOPP 2009.
  6. 01-May-2020: Niraj: The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code Ben Hardekopf and Calvin Lin, PLDI 2007.