February 26, 2021 Outline

Reading: text: , §17.2–17.3.2
Due: Homework #4, due March 5

Module 44

1. Non-lattice policies
   1. Transitivity
   2. Information flow policy
   3. Confinement flow model
2. Transitive non-lattice policies
   1. Quasi-ordered sets
3. Basic policy composition
4. Non-transitive policies
   1. Dual mappings
   2. Theorem: a dual mapping from a reflexive information flow policy into an ordered set is order-preserving

5. 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

Matt Bishop Office: 2209 Watershed Sciences Phone: +1 (530) 752-8060 Email: mabishop@ucdavis.edu

ECS 235B, Foundations of Computer and Information Security Version of February 27, 2021 at 10:35PM

You can also obtain a PDF version of this.