Author:
Harrison Michael A.,Ruzzo Walter L.,Ullman Jeffrey D.
Abstract
A model of protection mechanisms in computing systems is presented and its appropriateness is demonstrated. The “safety” problem for protection systems under our model is to determine in a given situation whether a subject can acquire a particular right to an object. In restricted cases, one can show that this problem is decidable, i.e., there is an algorithm to determine whether a system in a particular configuration is safe. In general, and under surprisingly weak assumptions, one cannot decide if a situation is safe. Various implications of this fact are discussed.
Publisher
Association for Computing Machinery (ACM)
Reference12 articles.
1. Programming semantics for multiprogrammed computations
2. Protection in an information processing utility
3. A. K. Jones "Protection in Programmed Systems " Ph.D. Thesis Department of Computer Science Carnegie-Mellon University Pittsburgh Pa. June 1973. A. K. Jones "Protection in Programmed Systems " Ph.D. Thesis Department of Computer Science Carnegie-Mellon University Pittsburgh Pa. June 1973.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exploiting Hot Spots in Heuristic Safety Analysis of Dynamic Access Control Models;Proceedings of the 17th International Joint Conference on e-Business and Telecommunications;2020
2. Bounded memory Dolev–Yao adversaries in collaborative systems;Information and Computation;2014-11
3. Bounded memory protocols;Computer Languages, Systems & Structures;2014-10
4. WorSE: A Workbench for Model-based Security Engineering;Computers & Security;2014-05
5. Mohawk;ACM Transactions on Information and System Security;2013-04