February 22, 2019 Outline

Reading: text, §9.1, 17
Due: Homework 3, due February 22, 2019

  1. Basic policy composition s
  2. Non-transitive policies
    1. Dual mappings
    2. Theorem: a dual mapping from a reflexive information flow policy into an ordered set is order-preserving
  3. Compiler-based flow mechanisms
    1. Scalar declarations
  4. 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
UC Davis seal
Matt Bishop
Office: 2209 Watershed Science
Phone: +1 (530) 752-8060
Email: [email protected]
You can also obtain a PDF version of this.
Version of February 23, 2019 at 2:56PM