Highly-structured software for network systems and its protection

Abstract

4.1.1 Access matrix model 4.1.2 Information flow model 4.1.3 Restrictions of the access matrix model 4.1.4 Problems of applying existing information flow models to the RM system 4.2 Overview of the Information Flow Control Mechanism 83 iv 4.2.1 Introduction 83 4.2.2 Handling implicit flows 94 4.2.3 Some remarks on probes and dynamically bound state variables 4.3 The Compile-Time Algorithm 4.3.1 Reduction rules 4.3.2 Generation of information flow templates 4.4 The Run-Time Algorithm 4.5 Program Examples 130 4.5.1 A program with no dynamically bound state variables 130 4.5.2 A program with dynamically bound state variables 144 5 LINK-TIME INFORMATION FLOW CERTIFICATION 155 5.1 The Link-Time Mechanism 157 5.2 Termination and Correctness of the Link-Time Algorithm 173 5.3 The Modified Link-Time Mechanism 176 5.4 The Link-time/Run-time Algorithm Allowing Dynamically Bound State Variables 194 5.5 Comparisons of the Information Flow Mechanisms 205 6 CONCLUSION 212