Abstract
In the context of operating system protection mechanisms,safety refers to the ability to decide who can obtained certain rights to resources by some future sequence of command invocations. Harrison, Ruzzo and Ullman have shown that in general safety is undecidable. On the other hand Jones, Lipton and Snyder have analyzed a simple system is which safety is decidable in time linear in the size of the system. This paper presents a large class of operating system protection mechanisms for which a polynomial time decision procedure for the safety question can be given. Extensions are then exhibited that are P-space complete andNP-complete.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, Ma., 1974.
M. Bishop and L. Snyder, The Transfer of Information and Authority in a Protection System,Proceedings of the 7th Symp. on Operating System Princ., pp. 45–54 (1979).
T. A. Budd and R. J. Lipton, On Classes of Protection Systems, inFoundations of Secure Computation, R. A. DeMillo, D. P. Dobkin, A. K. Jones, and R. J. Lipton (eds.), Academic Press, New York, pp. 281–296 (1978).
M. R. Garey and D. S. Johnson,Computers and Intractability, W. H. Freeman and Company, San Francisco, Ca. (1979).
G. S. Graham and P. J. Denning, Protection-Principles and Practice,Proceedings of the Spring Joint Computer Conference, pp. 94–102 (1972).
M. A. Harrison, W. L. Ruzzo, and J. D. Ullman, Protection in Operating Systems,Comm. ACM,19(8):461–471 (1976).
M. A. Harrison and W. L. Ruzzo, Monotonic Protection Systems, inFoundations of Secure Computation, R. A. DeMillo, D. P. Dobkin, A. K. Jones, and R. J. Lipton (eds.), Academic Press, New York (1978).
A. K. Jones, R. J. Lipton, and L. Snyder, A Linear-Time Algorithm for Deciding Security,Proceedings of the 17th Annual Symp. on Foundations of Computer Science, pp. 337–366 (1976).
A. K. Jones, Protection Mechanism Models: Their Usefulness, inFoundations of Secure Computation, R. A. DeMillo, D. P. Dobkin, A. K. Jones, and R. J. Lipton (eds.), Academic Press, New York, pp. 237–254 (1978).
R. J. Lipton and L. Snyder, On Synchronization and Security, inFoundations of Secure Computation, R. A. DeMillo, D. P. Dobkin, A. K. Jones, and R. J. Lipton (eds.), Academic Press, New York, pp. 367–388 (1978).
D. J. Rosenkrantz and H. B. Hunt III, Polynomial Algorithms for Deterministic Pushdown Automata,Siam J. on Computing 7(2):405–412 (1978).
W. J. Savitch, Relationship between Nondeterministic and Deterministic Tape Complexities,J. Computer and System Sciences,4:177–182.
C. P. Schnorr, An Algorithm for Transitive Closure with Linear Expected Time,Siam J. on Computing,7(2):127–133 (1978).
L. Snyder, Synthesis and Analysis in Protection Systems,Proceedings of the 6th Symp. on Operating System Prin., pp. 367–388 (1977).
L. Snyder, Formal Models of Capability-Based Protection Systems, Tech. Rep. Number 151, Yale University (1979).
L. Snyder, Theft and Conspiracy in the Take-Grant Model,J. Computer and System Sciences,23(3):333–347 (1981).
L. G. Valiant, General Context-Free Recognition in Less than Cubic Time,J. Computer and System Sciences,10:308–315 (1975).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Budd, T.A. Safety in grammatical protection systems. International Journal of Computer and Information Sciences 12, 413–431 (1983). https://doi.org/10.1007/BF00977968
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00977968