A Linear Time Algorithm for Deciding Subject Security

DOI10.1145/322017.322025MaRDI QIDQ4130983zbMATH OpenOpenAlexWikidataFDO

Authors Richard J. Lipton, Lawrence V. Snyder

Publication date 1977

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322017.322025

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cited in

(9)

• Operating system verification---an overview
• Creation and reflexive rights in grammatical protection systems
• Theft and conspiracy in the Take-Grant protection model
• Undecidability of safety for the schematic protection model with cyclic creates
• On complexity of grammars related to the safety problem
• seL4 enforces integrity
• Policy analysis for administrative role-based access control
• Nivat's processing systems: decision problems related to protection and synchronization
• Some variants of the take-grant protection model

This page was built for publication: A Linear Time Algorithm for Deciding Subject Security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4130983)