A Logic of Composition for Information Flow Predicates

Authors:
Ramesh V. Peri;William A. Wulf;Darrell M. Kienzle
Affiliations:
-;-;-
Venue:
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Year:
1996

Citing 3
Cited 1

A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions

SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
Specification and verification of security policies

Specification and verification of security policies
Formal Models of Capability-Based Protection Systems

IEEE Transactions on Computers

The framework of selective interleaving functions and the modular assembly kit

Proceedings of the 2005 ACM workshop on Formal methods in security engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Information flow predicates are properties of sets of traces and therefore cannot be handled under the Alpern-Schneider framework and the Abadi-Lamport Composition Principle. McLean proposed a theory in [MCL94] to investigate the composition properties of these predicates and derived a partial order on them. In this paper we present an alternate framework based on many-sorted predicate logic for specifying the information flow properties and show that this framework can be used to reason about the composition of such properties that is amenable to automated theorem proving.