The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Information flow inference for ML
Open accessAbstract
This paper presents a type-based information flow analysis for a call-by-value λ-calculus equipped with references, exceptions and let-polymorphism, which we refer to as ML. The type system is constraint-based and has decidable type inference. Its noninterference proof is reasonably light-weight, thanks to the use of a number of orthogonal techniques. First, a syntactic segregation between values and expressions allows a lighter formulation of the type system. Second, noninterference is reduced to subject reduction for a nonstandard language extension. Lastly, a semi-syntactic approach to type soundness allows dealing with constraint-based polymorphism separately.
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
Security Policies and Security Models
Goguen, J. A., & Meseguer, J. (1982) · 1982 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1982.10014 · Cited by 2,119
Secure Computer System: Unified Exposition and Multics Interpretation
Bell, D. E., & La Padula, L. J. (1976) · doi:10.21236/ada023588 · Cited by 1,916
Cryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
A Syntactic Approach to Type Soundness
Wright, A. K., & Felleisen, M. (1994) · Information and Computation · doi:10.1006/inco.1994.1093 · Cited by 1,136
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
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
Wadler, P. (1990) · Proceedings of the 1990 ACM conference on LISP and functional programming · doi:10.1145/91556.91592 · Cited by 576
The essence of compiling with continuations
Flanagan, C., Sabry, A., Duba, B. F., & Felleisen, M. (1993) · Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation · doi:10.1145/155090.155113 · Cited by 534
Abadi, M., Banerjee, A., Heintze, N., & Riecke, J. G. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292555 · Cited by 413
The SLam calculus: programming with secrecy and integrity
Heintze, N., & Riecke, J. G. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268976 · Cited by 410
A type-based approach to program security
Volpano, D., & Smith, G. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0030629 · Cited by 225
Type inference with constrained types
Odersky, M., Sulzmann, M., & Wehr, M. (1999) · Theory and Practice of Object Systems · doi:10.1002/(sici)1096-9942(199901/03)5:1<35::aid-tapo4>3.0.co;2-4 · Cited by 216
Simple imperative polymorphism
Wright, A. K. (1995) · LISP and Symbolic Computation · doi:10.1007/bf01018828 · Cited by 196
Information flow inference for ML
Pottier, F., & Simonet, V. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503302 · Cited by 191
Self-citationEliminating covert flows with minimum typings
Volpano, D., & Smith, G. (2002) · doi:10.1109/csfw.1997.596807 · Cited by 153
Secure information flow and pointer con .nement in a java-like language
Banerjee, A., & Naumann, D. A. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2002.1021820 · Cited by 147
A sound type system for secure flow analysis
VolpanoDennis, IrvineCynthia, & SmithGeoffrey (1996) · Journal of Computer Security · doi:10.5555/353629.353648 · Cited by 146
Theoretical Aspects of Object-Oriented Programming
Ohori, A., & Buneman, P. (1994) · The MIT Press eBooks · Cited by 141
Information flow inference for free
Pottier, F., & Conchon, S. (2000) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/351240.351245 · Cited by 121
Self-citationA simple view of type-secure information flow in the π-calculus
Pottier, F. (2003) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2002.1021826 · Cited by 106
Self-citationSecure Information Flow and CPS
Zdancewic, S., & Myers, A. C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45309-1_4 · Cited by 73
Mostly-Static Decentralized Information Flow Control
Myers, A. C., & Liskov, B. H. (1999) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 69
Secure Information Flow via Linear Continuations
Zdancewic, S., & Myers, A. C. (2002) · LISP and Symbolic Computation · doi:10.1023/a:1020843229247 · Cited by 66
Fine-grained information flow analysis for a ~ -calculus with sum types
Simonet, V. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2002.1021818 · Cited by 16
Self-citation
Cited by
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
Securing web application code by static analysis and runtime protection
Huang, Y.-W., Yu, F., Hang, C., Tsai, C.-H., Lee, D.-T., & Kuo, S.-Y. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988679 · Cited by 567
Advanced Topics in Types and Programming Languages
(2004) · The MIT Press eBooks · doi:10.7551/mitpress/1104.001.0001 · Cited by 348
Metadata
- Authors
- Pottier, F., & Simonet, V.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 2003-01
- Volume
- 25
- Issue
- 1
- Pages
- 117-158
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2061056245
- Cited by
- 262
- References
- 26
- FWCI
- 16.96
- 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.