×
Snyder, Lawrence

Theft and conspiracy in the Take-Grant protection model. (English) Zbl 0492.68054

J. Comput. Syst. Sci. 23, 333-347 (1981).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0492.68054

Cited in 2 Documents

MSC:

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

Keywords:

protection in computer systems; protection state of an operating system; finite set of graph transformation rules; safety problem; protection graph; Take-Grant transition rules; linear-time decision procedures; sharing relationships; can-steal predicate; stealing files; amount of cooperation; conspiracy

Citations:

Zbl 0327.68041; Zbl 0358.68041; Zbl 0454.68131
Cite Review PDF
Full Text: DOI Link

References:

[1] Harrison, M. A.; Ruzzo, W. L.; Ullman, J. D., Protection in operating systems, Commun. Assoc. Comput. Mach., 19, No. 8 (1976) · Zbl 0327.68041
[2] Lipton, R. J.; Snyder, L., A linear time algorithm for deciding subject security, 24, No. 3, 455-464 (1977) · Zbl 0358.68041
[3] Jones, A. K.; Lipton, R. J.; Snyder, L., A linear time algorithm for deciding security, (Proceedings, 17th FOCS (1976)) · Zbl 0358.68041
[4] Snyder, L., Analysis and synthesis in the Take-Grant system, (Proceedings, 6th SOSP (1977))
[5] Snyder, L., Formal models of capability-based protection systems, IEEE Trans. Comput. (1981) · Zbl 0454.68131
[6] Budd, T.; Lipton, R. J., Inert Rights and Conspirators in the Take/Grant System, Yale Department of Computer Science Technical Report No. 126 (1977)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.