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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer & Information Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
