The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A note on the confinement problem
Open accessAbstract
onfining a program during its execution so that it cannot transmit information to any other program except its caller. A set of examples attempts to stake out the boundaries of the problem. Necessary conditions for a solution are stated and informally justified.
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
A hardware architecture for implementing protection rings
Schroeder, M. D., & Saltzer, J. H. (1972) · Communications of the ACM · doi:10.1145/361268.361275 · Cited by 211
Lampson, B. (1969) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1478559.1478563 · Cited by 177
Self-citation
Cited by
Petitcolas, F. A. P., Anderson, R. J., & Kuhn, M. G. (1999) · Proceedings of the IEEE · doi:10.1109/5.771065 · Cited by 2,546
The protection of information in computer systems
Saltzer, J. H., & Schroeder, M. D. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9939 · Cited by 2,126
“[61] B.”
BackgroundMethodSecure Computer System: Unified Exposition and Multics Interpretation
Bell, D. E., & La Padula, L. J. (1976) · doi:10.21236/ada023588 · Cited by 1,916
Language-based information-flow security
Sabelfeld, A., & Myers, A. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.806121 · Cited by 1,907
A lattice model of secure information flow
Denning, D. E. (1976) · Communications of the ACM · doi:10.1145/360051.360056 · Cited by 1,907
Protection of information in computer systems
Saltier, J. H., & Schroeder, M. P. (1975) · IEEE CSIT Newsletter · doi:10.1109/csit.1975.6498831 · Cited by 1,419
Protection in operating systems
Harrison, M. A., Ruzzo, W. L., & Ullman, J. D. (1976) · Communications of the ACM · doi:10.1145/360303.360333 · Cited by 1,042
JFlow: practical mostly-static information flow control
Myers, A. C. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292561 · Cited by 1,034
Certification of programs for secure information flow
Denning, D. E., & Denning, P. J. (1977) · Communications of the ACM · doi:10.1145/359636.359712 · Cited by 1,029
Lattice-based access control models
Sandhu, R. S. (1993) · Computer · doi:10.1109/2.241422 · Cited by 714
Intrusion detection via static analysis
Wagner, D., & Dean, R. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924296 · Cited by 647
A survey of covert channels and countermeasures in computer network protocols
Zander, S., Armitage, G., & Branch, P. (2007) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2007.4317620 · Cited by 561
A decentralized model for information flow control
Myers, A. C., & Liskov, B. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266669 · Cited by 536
A taxonomy of computer program security flaws
Landwehr, C. E., Bull, A. R., McDermott, J. P., & Choi, W. S. (1994) · ACM Computing Surveys · doi:10.1145/185403.185412 · Cited by 449
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
Airavat: security and privacy for MapReduce
Roy, I., Setty, S., Kilzer, A., Shmatikov, V., & Witchel, E. (2010) · doi:10.5555/1855711.1855731 · Cited by 393
A survey of microarchitectural timing attacks and countermeasures on contemporary hardware
Ge, Q., Yarom, Y., Cock, D., & Heiser, G. (2018) · Journal of Cryptographic Engineering · doi:10.1007/s13389-016-0141-6 · Cited by 368
Design and verification of secure systems
Rushby, J. M. (1981) · ACM SIGOPS Operating Systems Review · doi:10.1145/1067627.806586 · Cited by 364
EROS: a fast capability system
Shapiro, J. S., Smith, J. M., & Farber, D. J. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319163 · Cited by 364
Taxonomy and Survey of Collaborative Intrusion Detection
Vasilomanolakis, E., Karuppayah, S., Mühlhäuser, M., & Fischer, M. (2015) · ACM Computing Surveys · doi:10.1145/2716260 · Cited by 326
Leaky Cauldron on the Dark Land: Understanding Memory Side-Channel Hazards in SGX
Wang, W., Chen, G., Pan, X., Zhang, Y., Wang, X., Bindschaedler, V., Tang, H., & Gunter, C. A. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134038 · Cited by 320
Fan, J., Xu, J., Ammar, M. H., & Moon, S. B. (2004) · Computer Networks · doi:10.1016/j.comnet.2004.03.033 · Cited by 288
King, S. T., & Chen, P. M. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945467 · Cited by 285
Covert and Side Channels Due to Processor Architecture
Wang, Z., & Lee, R. (2006) · 2006 22nd Annual Computer Security Applications Conference (ACSAC'06) · doi:10.1109/acsac.2006.20 · Cited by 270
Observational determinism for concurrent program security
Zdancewic, S., & Myers, A. C. (2004) · 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings. · doi:10.1109/csfw.2003.1212703 · Cited by 270
RIFLE: An Architectural Framework for User-Centric Information-Flow Security
Vachharajani, N., Bridges, M. J., Chang, J., Rangan, R., Ottoni, G., Blome, J. A., Reis, G. A., Vachharajani, M., & August, D. I. (2005) · 37th International Symposium on Microarchitecture (MICRO-37'04) · doi:10.1109/micro.2004.31 · Cited by 270
Hot or not: Revealing hidden services by their clock skew
Murdoch, S. J. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180410 · Cited by 253
CacheBleed: a timing attack on OpenSSL constant-time RSA
Yarom, Y., Genkin, D., & Heninger, N. (2017) · Journal of Cryptographic Engineering · doi:10.1007/s13389-017-0152-y · Cited by 210
“The idea dates back to [38] who suggests that processes can leak informationbymodifying theirCPUusage.”
Background(2001) · Cited by 127
Responses to catastrophic AGI risk: a survey
Sotala, K., & Yampolskiy, R. V. (2015) · Physica Scripta · doi:10.1088/0031-8949/90/1/018001 · Cited by 121
Information flow control for secure cloud computing
Bacon, J., Eyers, D., Pasquier, T. F. J.-M., Singh, J., Papagiannis, I., & Pietzuch, P. (2014) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2013.122313.130423 · Cited by 105
Detecting Multi-Agent Collusion Through Multi-Agent Interpretability
Rose, A., Cullen, C., Abdelnabi, S., Torr, P., Kaplowitz, B. G., & de Witt, C. S. (2026) · arXiv · doi:10.48550/arxiv.2604.01151
Metadata
- Authors
- Lampson, B. W.
- Venue
- Communications of the ACM
- Published
- 1973-10
- Volume
- 16
- Issue
- 10
- Pages
- 613-615
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2099137371
- Cited by
- 1,429
- References
- 2
- FWCI
- 21.41
- 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.