| Date | Topic to be covered | Reading List |
| T, 1/8 | Introduction | . |
| Th, 1/10 | Control Flow Analysis | Chapter 10 [ASU] |
| T, 1/15 | Data Flow Analysis (informal) | Chapter 10 [ASU] |
| Th, 1/17 | Data Flow Analysis Framework | Handout of my notes |
| T, 1/22 | Conditional Constant Propagation & Constant Folding | Wegman and Zadeck |
| Th, 1/24 | Copy Propagation | Handout of my notes |
| T, 1/29 | Partial Redundancy Elimination | PLDI'92 Paper |
| Th, 1/31 | Partial Dead Code Elimination | PLDI'94 Paper |
| T, 2/5 | Review | Review |
| Th, 2/7 | Exam I | Exam I |
| T, 2/12 | Machine Code Generation | Chapter 9 [ASU] |
| Th, 2/14 | Register Allocation | Papers [IBM TR, SIGPLAN Comp. Const. 1982] |
| T, 2/19 | Instruction Scheduling: Trace Scheduling | Chapter 4 of Ellis's thesis |
| Th, 2/21 | Software Pipelinning: Circular Scheduling | PLDI'91 |
| T, 2/26 | Static Single Assignment Form | POPL'89 |
| Th, 2/28 | SSA-based Sparse Conditional Constant Propagation | Wegman and Zadeck |
| T, 3/4 | Program Dependence Graphs | TOPLAS'87 |
| Th, 3/6 | Interprocedural Analysis | Chapter 7 by Sharir & Pnueli from |
| T, 3/11 | Review | Review |
| Th, 3/13 | Exam II | Exam II |