Outline for May 13, 2013

Reading: §16.1–16.4, 32, [BDU07] (This is available in the Resources area of SmartSite; look in the folder ``Handouts'')

  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

You can also obtain a PDF version of this. Version of May 12, 2013 at 8:30PM