| A Tentative Schedule of Lectures for CS638 (2006-2007) | ||||||||||||||
| Thursday Jan 4 | Motivation, Introduction to HRA, The big picture | |||||||||||||
| Monday Jan 8 | Introduction to data flow analysis. Formulating liveness analysis and available expressions analysis | |||||||||||||
| Thursday Jan 11 | Formulating Reaching Definitions, Anticipability, Dominance Analysis, Common form of data flow equations, A taxmonomy of data flow problems. | |||||||||||||
| Monday Jan 15 | Constant propagation, path based and edge based view view of data flow analysis | |||||||||||||
| Thursday Jan 18 | Partial Redundancy Elimination | |||||||||||||
| Monday Jan 22 | Faint Variables and Possibly Undefined Variables Analyses | |||||||||||||
| Thursday Jan 25 | Points-To Analysis | |||||||||||||
| Monday Jan 29 | Static program slicing | |||||||||||||
| Thursday Feb 1 | Lattice theoretical model of data flow analysis, Monotonicity, Distributivity and Boundedness | |||||||||||||
| Monday Feb 5 | Information flow paths and complexity of bit vector data flow analysis | |||||||||||||
| Thursday Feb 8 | Modelling non-separability, general information flow paths | |||||||||||||
| Monday Feb 12 | Undecidability results in data flow analysis | |||||||||||||
| Thursday Feb 15 | Interprocedural data flow analysis, Functional model of interprocedural data flow analysis | |||||||||||||
| Mid Semester Examination | ||||||||||||||
| Monday Feb 26 | Call string based interprocedural data flow analysis | |||||||||||||
| Thursday Mar 1 | Tutorial on call strings based data flow analysis | |||||||||||||
| Monday March 5 | Bounding call strings | |||||||||||||
| Thursday March 8 | More on call strings | |||||||||||||
| Monday March 12 | Introduction to heap reference analysis, access paths, transfer of access paths | |||||||||||||
| Thursday March 15 | Specifications of Liveness and Anticipability Analyses | |||||||||||||
| Monday March 19 | Specifications of Alias and Anticipability Analyses | |||||||||||||
| Thursday March 22 | Null assignment insertion criteria | |||||||||||||
| Monday March 26 | Access graphs, operations on access graphs | |||||||||||||
| Thursday March 29 | More on access graphs | |||||||||||||
| Monday April 2 | Data flow equations of heap reference analysis | |||||||||||||
| Thursday April 5 | Term paper presentations | |||||||||||||
| Monday April 9 | Term paper presentations | |||||||||||||
| Thursday April 12 | Term paper presentations | |||||||||||||
| End Semester Examination | ||||||||||||||