The DOI matches its Crossref record.
A Linear Time Algorithm for Deciding Subject Security
Open accessAbstract
A particular protection mechanism from the protection hterature-the take and grant system--is presented For this particular mechanism, it is shown that the safety problem can be solved in linear time Moreover the security policies that this mechanism can enforce are characterized KEY WORDS AND PHRASES protection,
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
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
Comprehensive formal verification of an OS microkernel
Klein, G., Andronick, J., Elphinstone, K., Murray, T., Sewell, T., Kolanski, R., & Heiser, G. (2014) · ACM Transactions on Computer Systems · doi:10.1145/2560537 · Cited by 348
seL4: From General Purpose to a Proof of Information Flow Enforcement
Murray, T., Matichuk, D., Brassil, M., Gammie, P., Bourke, T., Seefried, S., Lewis, C., Gao, X., & Klein, G. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.35 · Cited by 205
Metadata
- Authors
- Lipton, R. J., & Snyder, L.
- Venue
- Journal of the ACM
- Published
- 1977-07
- Volume
- 24
- Issue
- 3
- Pages
- 455-464
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2035142022
- Cited by
- 201
- References
- 0
- FWCI
- 16.94
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Linear Time Algorithm for Deciding Subject Security. https://app.cochat.ai/papers/10.1145/322017.322025
- The paper
- Lipton, R. J., & Snyder, L. (1977). A Linear Time Algorithm for Deciding Subject Security. Journal of the ACM. https://doi.org/10.1145/322017.322025
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.