UCLA CS 232 Static Program Analysis Spring 2006

• Time and place: Mon, Wed 2:00-3:50pm, ROLFE 2134.
• Professor: Jens Palsberg, 4531K Boelter Hall (palsberg@ucla.edu). Office hours: after each class until 4:30, in either 4531K BH or in 4810 BH.
• Reading list.
• Lectures Mon Apr 3, Wed Apr 5, Mon Apr 10: Register allocation and SSA form.
• Lecture Thu Apr 13, (unusual room) 1:00-2:30, 4549 Boelter Hall: Typed STIR: Formalising Type Systems for SSA and Fact Checking, guest speaker: Neal Glew, Intel.
• Lectures Mon Apr 17, Wed Apr 19, Mon Apr 24, Wed Apr 26, Mon May 1, Wed May 3, Mon May 8, Wed May 10: An introduction to static analysis of object-oriented programs. Class hierarchy analysis, rapid type analysis, equality-based analysis, subset-based analysis, flow-insensitive and flow-sensitive analysis, context-insensitive and context-sensitive analysis. Efficient data structures for static analysis information such as directed graphs and binary decision diagrams. Use of static program analysis for optimization. Flow-directed method inlining, type-safe method inlining.
• Lectures: Mon May 22, Wed May 24: Soundness proofs for static analyses.
• Lectures: Mon May 29, Wed May 31, Mon Jun 5, Wed Jun 7: Use of static program analysis for bug finding, including synchronization optimization, deadlock detection, security vulnerability detection.
• Homework 1, due Wed May 3 at Noon.
• Homework 2, due Wed Jun 14 at Noon.
• Final exam (30 %). Tuesday, June 13, 2006, 11:30 AM - 2:30 PM. Closed book.