Probabilistic interference
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 170-179
- https://doi.org/10.1109/risp.1990.63848
Abstract
D. McCullough's (1988) state machine formulism and definition of restrictiveness are restated. An example system is presented which illustrates the problem of probabilistic interference. An extension to McCullough's work that solves the problem of probabilistic interference is developed. A series of examples are presented which are designed to show the application of this extension. An example which is a novel solution to the so-called secure readers-writers problem is also presented.Keywords
This publication has 8 references indexed in Scilit:
- Noninterference and unwinding for LOCKPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Noninterference and the composability of security propertiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Probabilistic interferencePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Specifications for Multi-Level Security and a Hook-UpPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Unwinding and Inference ControlPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Security Policies and Security ModelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Synchronization with eventcounts and sequencersCommunications of the ACM, 1979
- Concurrent reading and writingCommunications of the ACM, 1977