**Reading:** *Chapters from revised text*, §17, C; [B+07]

**Due: ** Project Progress Report, May 12; Homework #3, May 19

- Entropy
- Entropy-based analysis
- Flow of information from $x$ to $y$
- Implicit flow of information

- Non-lattice policies
- Transitivity
- Information flow policy
- Confinement flow model

- Transitive non-lattice policies
- Quasi-ordered sets

- Non-transitive policies
- Dual mappings
- Theorem: a dual mapping from a reflexive information flow policy into an ordered set is order-preserving

- Compiler-based flow mechanisms
- Scalar declarations
- Array declarations
- Assignment statements
- Compound statements
- Conditional statements
- Iterative statements
- Goto statements
- Procedure calls
- Exceptions and infinite loops
- Semaphores
- Cobegin/coend
- Soundness

- Execution-based flow mechanisms
- Fenton’s Data Mark Machine
- Variable classes

You can also obtain a PDF version of this. | Version of May 9, 2017 at 11:58AM |