The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Certification of programs for secure information flow
Open accessAbstract
ertification mechanism for verifying the secure flow of information through a program. Because it exploits the properties of a lattice structure among security classes, the procedure is sufficiently simple that it can easily be included in the analysis phase of most existing compilers. Appropriate semantics are presented and proved correct. An important application is the confinement problem: The mechanism can prove that a program cannot cause supposedly nonconfidential results to depend on confidential input data.
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
Computation: Finite and Infinite Machines.
Clarke, D. A., & Minsky, M. L. (1968) · The American Mathematical Monthly · doi:10.2307/2313471 · Cited by 2,583
A lattice model of secure information flow
Denning, D. E. (1976) · Communications of the ACM · doi:10.1145/360051.360056 · Cited by 1,907
Self-citationA note on the confinement problem
Lampson, B. W. (1973) · Communications of the ACM · doi:10.1145/362375.362389 · Cited by 1,429
Secure Computer Systems: Mathematical Foundations
Bell, D. E., & LaPadula, L. J. (1973) · Defense Technical Information Center (DTIC) · Cited by 1,017
Allen, F. E. (1970) · ACM SIGPLAN Notices · doi:10.1145/390013.808479 · Cited by 738
Compiler construction for digital computers
Gries, D. J. (1971) · International Linear Collider · Cited by 504
Exception handling: issues and a proposed notation
Goodenough, J. B. (1975) · Communications of the ACM · doi:10.1145/361227.361230 · Cited by 496
Protection - Principles and practice
Graham, G., & Denning, P. J. (1972) · Managing Requirements Knowledge, International Workshop on · doi:10.1109/afips.1972.91 · Cited by 366
Self-citationProtection: principles and practice
Graham, G. S., & Denning, P. J. (1971) · Proceedings of the November 16-18, 1971, fall joint computer conference on - AFIPS '71 (Fall) · doi:10.1145/1478873.1478928 · Cited by 227
Self-citationSecurity controls in the ADEPT-50 time-sharing system
Weissman, C. (1969) · Proceedings of the November 18-20, 1969, fall joint computer conference on - AFIPS '69 (Fall) · doi:10.1145/1478559.1478574 · Cited by 158
Fenton, J. S. (1974) · The Computer Journal · doi:10.1093/comjnl/17.2.143 · Cited by 138
A comment on the confinement problem
Lipner, S. B. (1975) · ACM SIGOPS Operating Systems Review · doi:10.1145/1067629.806537 · Cited by 123
Discrete Mathematical Structures and Their Applications.
Leonard, P. A., & Stone, H. S. (1976) · American Mathematical Monthly · doi:10.2307/2977043 · Cited by 106
Secure information flow in computer systems.
Denning, D. E. (1975) · Purdue e-Pubs (Purdue University System) · Cited by 86
Self-citationOn protection in operating systems
Harrison, M. A., Ruzzo, W. L., & Ullman, J. D. (1975) · ACM Symposium on Operating Systems Principles (SOSP) · doi:10.1145/800213.806517 · Cited by 77
Protection in programmed systems.
Jones, A. K. (1973) · Cited by 65
On protection in operating systems
Harrison, M. A., Ruzzo, W. L., & Ullman, J. D. (1975) · ACM SIGOPS Operating Systems Review · doi:10.1145/1067629.806517 · Cited by 63
The enforcement of security policies for computation
Jones, A. K., & Lipton, R. J. (1975) · ACM SIGOPS Operating Systems Review · doi:10.1145/1067629.806538 · Cited by 45
The enforcement of security policies for computation
Jones, A. K., & Lipton, R. J. (1975) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/800213.806538 · Cited by 30
Making computers keep secrets.
Rotenberg, L. J. (1973) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 28
Memoryless execution: A programmer's viewpoint
Gat, I., & Saal, H. J. (1976) · Software Practice and Experience · doi:10.1002/spe.4380060404 · Cited by 20
Structured specification of a Security Kernel
Walter, K. G., Gilligan, J. M., Schaen, S. I., Ogden, W. F., Rounds, W. C., Shumway, D. G., Schaeffer, D. D., Biba, K. J., Bradshaw, F. T., & Ames, S. R. (1975) · International Conference on Reliable Software · doi:10.1145/800027.808450 · Cited by 15
Cops--a protection mechanism for computer systems.
Andrews, G. R. (1974) · Cited by 10
Cited by
Weiser, M. (1984) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1984.5010248 · Cited by 3,204
TaintDroid: an information-flow tracking system for realtime privacy monitoring on smartphones
Enck, W., Gilbert, P., Chun, B.-G., Cox, L. P., Jung, J., McDaniel, P. D., & Sheth, A. N. (2010) · doi:10.5555/1924943.1924971 · Cited by 2,238
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
Enck (2014) · doi:10.1145/2619091 · Cited by 1,203
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
Metadata
- Authors
- Denning, D. E., & Denning, P. J.
- Venue
- Communications of the ACM
- Published
- 1977-07
- Volume
- 20
- Issue
- 7
- Pages
- 504-513
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2129278597
- Cited by
- 1,029
- References
- 23
- FWCI
- 7.73
- 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.