The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Protection in operating systems
Open accessAbstract
A model of protection mechanisms in computing systems is presented and its appropriateness is argued. The “safety” problem for protection systems under this model is to determine in a given situation whether a subject can acquire a particular right to an object. In restricted cases, it can be shown that this problem is decidable, i.e. there is an algorithm to determine whether a system in a particular configuration is safe. In general, and under surprisingly weak assumptions, it cannot be decided if a situation is safe. Various implications of this fact are discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
A note on the confinement problem
Lampson, B. W. (1973) · Communications of the ACM · doi:10.1145/362375.362389 · Cited by 1,429
Formal Languages and Their Relation to Automata
Hopcroft, J. E., & Ullman, J. D. (1969) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,355
Self-citationFormal Languages and their Relation to Automata
Morris, J. B. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19706 · Cited by 998
Ritchie, D. M., & Thompson, K. (1983) · Communications of the ACM · doi:10.1145/357980.358014 · Cited by 960
Ritchie, D. M., & Thompson, K. (1974) · Communications of the ACM · doi:10.1145/361011.361061 · Cited by 826
Programming semantics for multiprogrammed computations
Dennis, J. B., & Van Horn, E. C. (1983) · Communications of the ACM · doi:10.1145/357980.357993 · Cited by 676
Programming semantics for multiprogrammed computations
Dennis, J. B., & Van Horn, E. C. (1966) · Communications of the ACM · doi:10.1145/365230.365252 · Cited by 575
Lampson, B. W. (1974) · ACM SIGOPS Operating Systems Review · doi:10.1145/775265.775268 · Cited by 506
Protection and the control of information sharing in multics
Saltzer, J. H. (1974) · Communications of the ACM · doi:10.1145/361011.361067 · Cited by 392
Cited by
On the security of public key protocols
Dolev, D., & Yao, A. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056650 · Cited by 5,833
The UCONABCusage control model
Park, J., & Sandhu, R. (2004) · ACM Transactions on Information and System Security · doi:10.1145/984334.984339 · Cited by 956
The ARBAC97 model for role-based administration of roles
Sandhu, R., Bhamidipati, V., & Munawer, Q. (1999) · ACM Transactions on Information and System Security · doi:10.1145/300830.300839 · Cited by 605
Organization based access control
Kalam, A. A. E., Baida, R. E., Balbiani, P., Benferhat, S., Cuppens, F., Deswarte, Y., Miege, A., Saurel, C., & Trouessin, G. (2004) · Proceedings POLICY 2003. IEEE 4th International Workshop on Policies for Distributed Systems and Networks · doi:10.1109/policy.2003.1206966 · Cited by 559
Access Control: Policies, Models, and Mechanisms
Samarati, P., & de Vimercati, S. C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45608-2_3 · Cited by 551
Understanding Android Security
Enck, W., Ongtang, M., & McDaniel, P. (2009) · IEEE Security & Privacy Magazine · doi:10.1109/msp.2009.26 · Cited by 544
On the security of public key protocols
Dolev, D., & Yao, A. C. (1981) · 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) · doi:10.1109/sfcs.1981.32 · Cited by 478
Software engineering for security: a roadmap
Devanbu, P. T., & Stubblebine, S. (2000) · Proceedings of the Conference on The Future of Software Engineering · doi:10.1145/336512.336559 · Cited by 418
Secure information flow in a multi-threaded imperative language
Smith, G., & Volpano, D. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268975 · Cited by 406
The role graph model and conflict of interest
Nyanchama, M., & Osborn, S. (1999) · ACM Transactions on Information and System Security · doi:10.1145/300830.300832 · Cited by 280
Framework for role-based delegation models
Barka, E., & Sandhu, R. (2002) · Proceedings 16th Annual Computer Security Applications Conference (ACSAC'00) · doi:10.1109/acsac.2000.898870 · Cited by 268
Relationship-based access control: protection model and policy language
Fong, P. W. L. (2011) · Proceedings of the first ACM conference on Data and application security and privacy · doi:10.1145/1943513.1943539 · Cited by 267
Trust relationships in secure systems-a distributed authentication perspective
Yahalom, R., Klein, B., & Beth, T. (2002) · Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1993.287635 · Cited by 263
Security models for web-based applications
Joshi, J. B. D., Aref, W. G., Ghafoor, A., & Spafford, E. H. (2001) · Communications of the ACM · doi:10.1145/359205.359224 · Cited by 255
Anderson, R., Stajano, F., & Lee, J.-H. (2002) · Advances in Computers · doi:10.1016/s0065-2458(01)80030-9 · Cited by 11
Function-Based Access Control (FBAC): Towards Preventing Insider Threats in Organizations
Desmedt, Y., & Shaghaghi, A. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-04834-1_8 · Cited by 5
Metadata
- Authors
- Harrison, M. A., Ruzzo, W. L., & Ullman, J. D.
- Venue
- Communications of the ACM
- Published
- 1976-08
- Volume
- 19
- Issue
- 8
- Pages
- 461-471
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2053741629
- Cited by
- 1,042
- References
- 17
- FWCI
- 43.23
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.