CIS 890, Program Analysis and Computability, Fall 2010

Torben Amtoft
Tuesdays, 9:30-11:30am in N236.
Form of class:
Presentations by students and instructor, leading to class discussions. (Larger projects could arise from this class.)


August 24
Introduction to course.
August 31
Joseph leads us through the first 4 sections of Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints by Patrick Cousot and Radhia Cousot.
September 7
Joseph finishes the Cousot-paper; we work out several examples that help us understand the paper better.
September 14
Vineet presents Chapter 1 of Principles of Program Analysis by Nielson & Nielson & Hankin, giving a brief introduction to
September 21
Jason presents Volpano & Smith & Irvine's A Sound Type System for Secure Flow Analysis. We also discuss some limitations of non-interference, like if
September 28
Balaji introduces Turing machines, including Torben then outlines the principle of diagonalization, for instance used to show that the real numbers are not countable.
October 5
October 12
Torben introduces the concepts of NP, and NP-hardness.
October 19
October 26
November 2
November 9
November 16
First some brief presentations: Then Joseph prepares for non-standard analysis by introducing (ultra)filters.
November 30
Last day of class.

Torben Amtoft