The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Secure Information Flow as a Safety Problem
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
Cites
A Temporal Logic of Nested Calls and Returns
Alur, R., Etessami, K., & Madhusudan, P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24730-2_35 · Cited by 3,339
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
Henzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503279 · Cited by 1,155
The S LAM project: debugging system software via static analysis
Ball, T., & Rajamani, S. K. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503274 · Cited by 923
A general theory of composition for trace sets closed under selective interleaving functions
McLean, J. (2002) · Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1994.296590 · Cited by 324
A type-based approach to program security
Volpano, D., & Smith, G. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0030629 · Cited by 225
Abstract Non-Interference: A Unifying Framework for Weakening Information-flow
Giacobazzi, R., & Mastroeni, I. (2018) · ACM Transactions on Privacy and Security · doi:10.1145/3175660 · Cited by 210
Secure information flow by self-composition
Barthe, G., D’Argenio, P. R., & Rezk, T. (2004) · doi:10.1109/csfw.2004.17 · Cited by 209
A Theorem Proving Approach to Analysis of Secure Information Flow
Darvas, Á., Hähnle, R., & Sands, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-32004-3_20 · Cited by 204
A Model for Delimited Information Release
Sabelfeld, A., & Myers, A. C. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-37621-7_9 · Cited by 196
Zdancewic, S., & Myers, A. C. (2005) · Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. · doi:10.1109/csfw.2001.930133 · Cited by 196
Secure information flow by self-composition
Barthe, G., D'Argenio, P. R., & Rezk, T. (2004) · Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004. · doi:10.1109/csfw.2004.1310735 · Cited by 177
Downgrading policies and relaxed noninterference
Li, P., & Zdancewic, S. (2005) · Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1040305.1040319 · Cited by 167
Transition predicate abstraction and fair termination
Podelski, A., & Rybalchenko, A. (2005) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1232420.1232422 · Cited by 135
Relative Completeness of Abstraction Refinement for Software Model Checking
Ball, T., Podelski, A., & Rajamani, S. K. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46002-0_12 · Cited by 96
Information Flow Analysis in Logical Form
Amtoft, T., & Banerjee, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27864-1_10 · Cited by 96
Cited by
Temporal Logics for Hyperproperties
Clarkson, M. R., Finkbeiner, B., Koleini, M., Micinski, K. K., Rabe, M. N., & Sánchez, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-54792-8_15 · Cited by 270
A Formal Foundation for Secure Remote Execution of Enclaves
Subramanyan, P., Sinha, R., Lebedev, I., Devadas, S., & Seshia, S. A. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134098 · Cited by 119
Metadata
- Authors
- Terauchi, T., & Aiken, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 352-367
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2139799388
- Cited by
- 282
- References
- 16
- FWCI
- 5.72
- 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.