• Week 1: Ch. 1, 2, 7.
• Week 2: Ch. 8.
• Week 3: Tues Apr 18: TWO papers:
  1. Improving the Cache Locality of Memory Allocation Grunwald, Zorn, Henderson, PLDI 93.
  2.(Hard copy was distributed) Data Flow Analysis for Verifying Properties of Concurrent Programs , by Matthew Dwyer and Lori Clarke
• Week 4:
  Efficiently Computing SSA and the Control Dependence Graph by Cytron, Ferrante, Rosen, Wegman and Zadeck, ACM Transactions on Programming Languages and Systems, Vol 13, No 4, Oct. 1991, pp. 451-490.
  Ch. 9 (except for 9.2)
• Week 5: 10.1, 11, 12.1-12.3, 12.4.1, 12.5
  Detecting equality of variables in programs by B. Alpern, M. N. Wegman and F. K. Zadeck ,in POPL88,pp. 1-11
• Week 6: 13.1, 13.2, 13.5, 12.6
• Week 7: Ch 16, 17.1
• Week 8:
  Making Graphs Reducible with Controlled Node Splitting by Johan Jannsen and Henk Corporaal