A Linear Time Algorithm for Deciding Subject Security

DOI10.1145/322017.322025zbMath0358.68041OpenAlexW2035142022WikidataQ114977143 ScholiaQ114977143MaRDI QIDQ4130983

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)

Related Items (9)

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

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