Security models for priority buffering and interrupt handling

Abstract

Ways to securely buffer messages are examined. The focus is on the development of a decomposition theorem for the theory of restrictiveness, so that if the buffering part of a process and the output part of a process satisfy the specified constraints then the combined process is restrictive. This technique is applied to a number of buffering methods, including a priority queue. A method of decomposition for interrupt handling is shown.<>