Formal policies for trusted processes
A state machine model is introduced for trusted processes. It makes explicit use of the notion of locking part of the state space in order to allow privileged actions to overlap. The model controls the interaction between overlapping actions by restricting the events that can change the locks, using...
Saved in:
Published in | Proceedings of the Computer Security Foundations Workshop II pp. 31 - 40 |
---|---|
Main Authors | , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE Comput. Soc. Press
1989
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A state machine model is introduced for trusted processes. It makes explicit use of the notion of locking part of the state space in order to allow privileged actions to overlap. The model controls the interaction between overlapping actions by restricting the events that can change the locks, using the locks to restrict which events can change which parts of the state space, and preventing the initiation of actions that would interfere with currently executing ones.< > |
---|---|
DOI: | 10.1109/CSFW.1989.40584 |