Outline for March 5, 2007

1. Greetings and Felicitations!
2. Transitive nonlattice policies
   1. Quasi-ordered sets
3. Nontransitive policies
   1. Dual mappings
   2. Theorem: a dual mapping from a reflexive information flow policy into an ordered set is order-preserving
4. Compiler-based flow mechanisms
   1. Scalar declarations
   2. Array declarations
   3. Assignment statements
   4. Compound statements
   5. Conditional statements
   6. Iteratve statements
   7. Goto statements
   8. Procedure calls