May 10, 2017 Outline

Reading: Chapters from revised text, §17, C; [B+07]
Due: Project Progress Report, May 12; Homework #3, May 19

1. Entropy
2. Entropy-based analysis
   1. Flow of information from $x$ to $y$
   2. Implicit flow of information
3. Non-lattice policies
   1. Transitivity
   2. Information flow policy
   3. Confinement flow model
4. Transitive non-lattice policies
   1. Quasi-ordered sets
5. Non-transitive policies
   1. Dual mappings
   2. Theorem: a dual mapping from a reflexive information flow policy into an ordered set is order-preserving
6. Compiler-based flow mechanisms
   1. Scalar declarations
   2. Array declarations
   3. Assignment statements
   4. Compound statements
   5. Conditional statements
   6. Iterative statements
   7. Goto statements
   8. Procedure calls
   9. Exceptions and infinite loops
   10. Semaphores
   11. Cobegin/coend
   12. Soundness
7. Execution-based flow mechanisms
   1. Fenton’s Data Mark Machine
   2. Variable classes