Theft and conspiracy in the Take-Grant protection model

DOI10.1016/0022-0000(81)90069-6zbMath0492.68054OpenAlexW1966364460MaRDI QIDQ1168082

Lawrence V. Snyder

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cstech/291

zbMATH Keywords

conspiracyamount of cooperationcan-steal predicatefinite set of graph transformation ruleslinear-time decision proceduresprotection graphprotection in computer systemsprotection state of an operating systemsafety problemsharing relationshipsstealing filesTake-Grant transition rules

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25) Theory of software (68N99)

Related Items (2)

Safety in grammatical protection systems ⋮ Some variants of the take-grant protection model

Cites Work

• Formal Models of Capability-Based Protection Systems
• Protection in operating systems
• A Linear Time Algorithm for Deciding Subject Security

This page was built for publication: Theft and conspiracy in the Take-Grant protection model