ACM Home Page
Please provide us with feedback. Feedback
A Linear Time Algorithm for Deciding Subject Security
Full text PdfPdf (465 KB)
Source Journal of the ACM (JACM) archive
Volume 24 ,  Issue 3  (July 1977) table of contents
Pages: 455 - 464  
Year of Publication: 1977
ISSN:0004-5411
Authors
R. J. Lipton  Department of Computer Science, Yale University, 10 Hillhouse Avenue, New Haven, CT
L. Snyder  Department of Computer Science, Yale University, 10 Hillhouse Avenue, New Haven, CT
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 46,   Citation Count: 24
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322017.322025
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
DENmNG, P J , AND GRAHAM, G S Protection--principles and pracuce Proc AFIPS 1972 SJCC, Vol 40, AFIPS Press, Montvale, N J , pp 417-429
3
 
4
 
5
JONES, A K, LwroN, R J, AND SNYDER, L A hnear time algorithm for deciding subJect-obJect security Proc 17th Annual FOCS Conf, Houston, 1976, pp 33-41,
 
6
LwroN, R J , AND SNVDER, L Synchromzat~on and security In preparation, 1976

CITED BY  24