The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
The SLam calculus: programming with secrecy and integrity
Abstract
The SLam calculus is a typed λ-calculus that maintains security information as well as type information. The type system propagates security information for each object in four forms: the object's creators and readers, and the object's indirect creators and readers (i.e., those agents who, through flow-of-control or the actions of other agents, can influence or be influenced by the content of the object). We prove that the type system prevents security violations and give some examples of its power.
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
Milner, R., Harper, R., MacQueen, D., & Tofte, M. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/2319.001.0001 · Cited by 2,419
A lattice model of secure information flow
Denning, D. E. (1976) · Communications of the ACM · doi:10.1145/360051.360056 · Cited by 1,907
A calculus for cryptographic protocols: the spi calculus
Abadi, M., & Gordon, A. D. (1997) · Proceedings of the 4th ACM conference on Computer and communications security · doi:10.1145/266420.266432 · Cited by 1,154
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
The Definition of Standard ML (Revised)
Milner, R., Harper, R. W., MacQueen, D. B., & Tofte, M. (1997) · Cited by 985
A sound type system for secure flow analysis
Volpano, D., Irvine, C., & Smith, G. (1996) · Journal of Computer Security · doi:10.3233/jcs-1996-42-304 · Cited by 969
Types, Abstraction and Parametric Polymorphism.
Reynolds, J. (1983) · IFIP Congress · Cited by 754
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
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
Secrecy by typing in security protocols
Abadi, M. (1999) · Journal of the ACM · doi:10.1145/324133.324266 · Cited by 314
The theory and practice of first-class prompts
Felleisen, M. (1988) · Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88 · doi:10.1145/73560.73576 · Cited by 292
Noninterference and the composability of security properties
McCullough, D. (2003) · Proceedings. 1988 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1988.8110 · Cited by 261
A type-based approach to program security
Volpano, D., & Smith, G. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0030629 · Cited by 225
Eliminating covert flows with minimum typings
Volpano, D., & Smith, G. (2002) · doi:10.1109/csfw.1997.596807 · Cited by 153
An Axiomatic Approach to Information Flow in Programs
Andrews, G. R., & Reitman, R. P. (1980) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357084.357088 · Cited by 149
Secrecy by typing in security protocols
Abadi, M. (1997) · Lecture notes in computer science · doi:10.1007/bfb0014571 · Cited by 105
Ørbæk, P., & Palsberg, J. (1997) · Journal of Functional Programming · doi:10.1017/s0956796897002906 · Cited by 98
Secure information flow in computer systems.
Denning, D. E. (1975) · Purdue e-Pubs (Purdue University System) · Cited by 86
Compile-time detection of information flow in sequential programs
Banâtre, J.-P., Bryce, C., & Métayer, D. L. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58618-0_56 · Cited by 62
Palsberg, J., & Ørb⇓ek, P. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60360-3_47 · Cited by 24
Cited by
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
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
Metadata
- Authors
- Heintze, N., & Riecke, J. G.
- Venue
- Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98
- Publisher
- ACM Press
- Published
- 1998
- Pages
- 365-377
- OpenAlex
- W2016017569
- Cited by
- 410
- References
- 20
- FWCI
- 22.88
- Type
- conference paper
- Language
- en
- Open access
- closed
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.