The DOI matches its Crossref record; 160 of the 164 references it cites were found in a registry or an index.
Language-based information-flow security
Abstract
Current standard security practices do not provide substantial assurance that the end-to-end behavior of a computing system satisfies important security policies such as confidentiality. An end-to-end confidentiality policy might assert that secret input data cannot be inferred by an attacker through the attacker's observations of system output; this policy regulates information flow. Conventional security mechanisms such as access control and encryption do not directly address the enforcement of information-flow policies. Previously, a promising new approach has been developed: the use of programming-language techniques for specifying and enforcing information-flow policies. In this paper, we survey the past three decades of research on information-flow security, particularly focusing on work that uses static program analysis to enforce information-flow policies. We give a structured view of work in the area and identify some important open challenges.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“As tasks are decomposed across agents, intermediate outputs (e.g., summaries, plans, or tool calls) may implicitly encode or propagate sensitive information beyond intended scopes, creating implicit information flows that bypass explicit access controls (Denning, 1976;Sabelfeld & Myers, 2003).”
From Open Challenges in Multi-Agent Security: Towards Secure Systems of Interacting AI Agents (2025) · cites this paper as Sabelfeld & Myers, 2003
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · The MIT Press eBooks · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 50,201
A mathematical theory of communication
Hockett, C. F., Shannon, C., & Weaver, W. (1948) · MOCO · doi:10.1145/584091.584093 · Cited by 30,543
The Mathematical Theory of Communication
Shannon, C. E., Weaver, W., & Wiener, N. (1950) · Physics Today · doi:10.1063/1.3067010 · Cited by 9,882
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
On the security of public key protocols
Dolev, D., & Yao, A. C.-C. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056650 · Cited by 5,908
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Kocher, P. C. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_9 · Cited by 4,446
The Lambda Calculus - Its Syntax and Semantics
(1984) · Studies in logic and the foundations of mathematics · doi:10.1016/c2009-0-14341-6 · Cited by 2,806
End-to-end arguments in system design
Saltzer, J. H., Reed, D. P., & Clark, D. D. (1984) · ACM Transactions on Computer Systems · doi:10.1145/357401.357402 · Cited by 2,198
End-To-End Arguments In System Design
And, S. R., Saltzer, J. H., Reed, D. P., & Clark, D. D. (1984) · Cited by 2,130
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
Flagged first, then by citations
4 of the 164 references couldn’t be matched to a known paper.
Research works printed but not linked: 13
- Barthe, Partial evaluation and noninterference for object calculi, LNCS 1722, 53
- Lindholm, 1996, The Java Virtual Machine.
- Fenton, 1973, Information protection systems
- LaPadula, 1973, Secure Computer Systems: A Mathematical Model, MITRE Corp., Bedford, MA, MTR-2547, vol. 2, 4, 239
- Cohen, 1978, Information transmission in sequential programs, 297
- Mizuno, Information flow control in a distributed object-oriented system with statically-bound object variables, 56
- Mizuno, A least fixed point approach to inter-procedural information flow control, 558
- Giambiagi, 2002, Confidentiality for Implementations of Security Protocols.
- Pierro, Approximate noninterference, 1
- Sutherland, A model of information, 175
- Leino, A semantic approach to secure information flow, LNCS 1422, 254
- Thiemann, Enforcing security properties by type specialization, LNCS 2028
- Abramksy, 1998, Game semantics
Cited by
Sorted by citations
Items 301–400 of 1,001
Observational purity and encapsulation
Naumann, D. A. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.02.004 · Cited by 40
Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus
Gordon, A. D., & Jeffrey, A. (2005) · Lecture notes in computer science · doi:10.1007/11539452_17 · Cited by 40
Bidirectional programming languages
Pierce, B. C., & Foster, J. N. (2009) · Cited by 39
Computing the Leakage of Information-Hiding Systems
Andrés, M. E., Catuscia Palamidessi, A., van Rossum, P., & Smith, G. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12002-2_32 · Cited by 39
Eldib, H., Wang, C., Taha, M. M. I., & Schaumont, P. R. (2014) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2593069.2593193 · Cited by 39
Verifying Information Flow Properties of Firmware using Symbolic Execution
Subramanyan, P., Malik, S., Khattri, H., Maiti, A., & Fung, J. M. (2016) · Design, Automation, and Test in Europe · doi:10.3850/9783981537079_0793 · Cited by 39
Security slicing for auditing common injection vulnerabilities
Thomé, J., Shar, L. K., Bianculli, D., & Briand, L. (2017) · Journal of Systems and Software · doi:10.1016/j.jss.2017.02.040 · Cited by 39
Static Identification of Injection Attacks in Java
Spoto, F., Burato, E., Ernst, M. D., Ferrara, P., Lovato, A., Macedonio, D., & Spiridon, C. (2019) · ACM Transactions on Programming Languages and Systems · doi:10.1145/3332371 · Cited by 39
Nonmalleable Information Flow Control
Cecchetti, E., Myers, A. C., & Arden, O. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3134054 · Cited by 39
Self-citationTheoretical analysis of gate level information flow tracking
Oberg, J. K., Hu, W., Irturk, A. U., Tiwari, M., Sherwood, T., & Kastner, R. (2010) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/1837274.1837337 · Cited by 38
Cache-Leakage Resilient OS Isolation in an Idealized Model of Virtualization
Barthe, G., Betarte, G., Campo, J. D., & Luna, C. (2012) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2012.17 · Cited by 38
A Library for Secure Multi-threaded Information Flow in Haskell
Tsai, T.-C., Russo, A., & Hughes, J. (2007) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2007.6 · Cited by 38
SpanDex: secure password tracking for android
Cox, L. P., Gilbert, P., Lawler, G., Pistol, V., Razeen, A., Wu, B., & Cheemalapati, S. (2014) · USENIX Security Symposium · Cited by 38
Moving psychological assessment out of the controlled laboratory setting: Practical challenges.
Holmlund, T. B., Foltz, P. W., Cohen, A. S., Johansen, H. D., Sigurdsen, R., Fugelli, P., Bergsager, D., Cheng, J., Bernstein, J., Rosenfeld, E. P., et al. (2019) · Psychological Assessment · doi:10.1037/pas0000647 · Cited by 38
Compositional Security for Reentrant Applications
Cecchetti, E., Yao, S., Ni, H., & Myers, A. C. (2021) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp40001.2021.00084 · Cited by 38
Self-citationSecure information flow and program logics
Beringer, L., & Hofmann, M. (2007) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2007.30 · Cited by 38
The security pi-calculus and non-interference
Hennessy, M. (2004) · The Journal of Logic and Algebraic Programming · doi:10.1016/j.jlap.2004.01.003 · Cited by 38
A Complete Axiomatization of Knowledge and Cryptography
Cohen, M., & Dam, M. (2007) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.2007.4 · Cited by 38
A Framework for the Cryptographic Verification of Java-Like Programs
Küsters, R., Truderung, T., & Graf, J. (2012) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2012.9 · Cited by 37
Testing noninterference, quickly
Hriţcu, C., Hughes, J., Pierce, B. C., Spector-Zabusky, A., Vytiniotis, D., de Amorim, A. A., & Lampropoulos, L. (2013) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/2500365.2500574 · Cited by 37
Session Types for Access and Information Flow Control
Capecchi, S., Castellani, I., Mariangiola Dezani-ciancaglini, A., & Rezk, T. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15375-4_17 · Cited by 37
Foster, J. N., Pierce, B. C., & Zdancewic, S. (2009) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2009.25 · Cited by 37
Secure Information Flow as a Safety Property
Boudol, G. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01465-9_2 · Cited by 37
Hicks, B., King, D., McDaniel, P. D., & Hicks, M. (2006) · ACM Workshop on Programming Languages and Analysis for Security · doi:10.1145/1134744.1134757 · Cited by 37
Amtoft, T., & Banerjee, A. (2006) · Science of Computer Programming · doi:10.1016/j.scico.2006.03.002 · Cited by 37
Flexible dynamic information flow control in the presence of exceptions
Stefan, D., Mazières, D., Mitchell, J. C., & Russo, A. (2017) · Journal of Functional Programming · doi:10.1017/s0956796816000241 · Cited by 36
ct-fuzz: Fuzzing for Timing Leaks
He, S., Emmi, M., & Ciocarlie, G. F. (2020) · IEEE International Conference on Software Testing, Verification and Validation (ICST) · doi:10.1109/icst46399.2020.00063 · Cited by 36
Livshits, B., Nori, A. V., Rajamani, S. K., & Banerjee, A. (2009) · ACM SIGPLAN Notices · doi:10.1145/1543135.1542485 · Cited by 36
Automatic Information Flow Analysis of Business Process Models
Accorsi, R., & Lehmann, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32885-5_13 · Cited by 36
Run-time principals in information-flow type systems
Tse, S., & Zdancewic, S. (2007) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1290520.1290526 · Cited by 36
Security Metrics for Object-Oriented Designs
Alshammari, B. M., Fidge, C., & Corney, D. (2010) · Australasian Software Engineering Conference (ASWEC) · doi:10.1109/aswec.2010.34 · Cited by 36
Type-preserving compilation of end-to-end verification of security enforcement
Chen, J., Chugh, R., & Swamy, N. (2010) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1806596.1806643 · Cited by 36
A Cryptographic Decentralized Label Model
Vaughan, J. A., & Zdancewic, S. (2007) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2007.5 · Cited by 36
Dynamic updating of information-flo w policies
Zdancewic, S. A., Hicks, M., Tse, S., & Hicks, B. (2005) · Cited by 36
Improving software security with precise static and runtime analysis
Lam, M. S., & Livshits, B. (2006) · Cited by 36
Disciplined Inconsistency with Consistency Types
Holt, B., Bornholt, J., Zhang, I. Y., Ports, D. R. K., Oskin, M., & Ceze, L. (2016) · ACM Symposium on Cloud Computing (SoCC) · doi:10.1145/2987550.2987559 · Cited by 36
Type-based distributed access control
Tom Chothia, A., Duggan, D., & Vítek, J. (2004) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2003.1212712 · Cited by 36
Pattern-Based Vulnerability Discovery
Yamaguchi, F. (2015) · doi:10.53846/goediss-5356 · Cited by 36
A Conference Management System with Verified Document Confidentiality
Kanav, S., Lammich, P., & Popescu, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-08867-9_11 · Cited by 35
Automating Information Flow Analysis of Low Level Code
Balliu, M., Dam, M., & Guanciale, R. (2014) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2660267.2660322 · Cited by 35
Unifying Facets of Information Integrity
Birgisson, A., Russo, A., & Sabelfeld, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17714-9_5 · Cited by 35
Self-citationOn-the-fly inlining of dynamic security monitors
Magazinius, J., Russo, A., & Sabelfeld, A. (2011) · Computers & Security · doi:10.1016/j.cose.2011.10.002 · Cited by 35
Self-citationMixT: a language for mixing consistency in geodistributed transactions
Milano, M., & Myers, A. C. (2018) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3192366.3192375 · Cited by 35
Self-citationTowards Better Utilizing Static Application Security Testing
Yang, J., Tan, L., Peyton, J., & Duer, K. A. (2019) · IEEE/ACM International Conference on Software Engineering: Software Engineering in Practice (ICSE-SEIP) · doi:10.1109/icse-seip.2019.00014 · Cited by 35
Language-based control and mitigation of timing channels
Zhang, D., Askarov, A., & Myers, A. C. (2012) · ACM SIGPLAN Notices · doi:10.1145/2345156.2254078 · Cited by 35
Self-citationBridging Language-Based and Process Calculi Security
Riccardo Focardi, A., Rossi, S., & Sabelfeld, A. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31982-5_19 · Cited by 35
Self-citationJulia: A Generic Static Analyser for the Java Bytecode
Spoto, F. (2005) · Cited by 35
Hybrid Monitors for Concurrent Noninterference
Askarov, A., Chong, S., & Mantel, H. (2015) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2015.17 · Cited by 34
Flexible Scheduler-Independent Security
Mantel, H., & Sudbrock, H. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15497-3_8 · Cited by 34
Precise Enforcement of Confidentiality for Reactive Systems
Zanarini, D., Jaskelioff, M., & Russo, A. (2013) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2013.9 · Cited by 34
Static Code Analysis for Software Security Verification: Problems and Approaches
Zhioua, Z., Short, S., & Roudier, Y. (2014) · IEEE Annual Computer Software and Applications Conference Workshops (COMPSACW) · doi:10.1109/compsacw.2014.22 · Cited by 34
Secure Multi-execution in Haskell
Jaskelioff, M., & Russo, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29709-0_16 · Cited by 34
Information-Flow Control for Programming on Encrypted Data
Mitchell, J. C., Sharma, R., Stefan, D., & Zimmerman, J. (2012) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2012.30 · Cited by 34
Towards Property Driven Hardware Security
Hu, W., Althoff, A., Ardeshiricham, A., & Kastner, R. (2016) · International Workshop on Microprocessor Test and Verification (MTV) · doi:10.1109/mtv.2016.12 · Cited by 34
Fabric: Building open distributed systems securely by construction
Liu, J., Arden, O., George, M. D., & Myers, A. C. (2017) · Journal of Computer Security · doi:10.3233/jcs-15805 · Cited by 34
Self-citationFinkbeiner, B., Hahn, C., Stenger, M., & Tentrup, L. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-67531-2_12 · Cited by 34
QUAIL: A Quantitative Security Analyzer for Imperative Code
Biondi, F., Legay, A., Traonouez, L., & Wąsowski, A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39799-8_49 · Cited by 34
From trusted to secure: building and executing applications that enforce system security
Hicks, B., Rueda, S. J., Jaeger, T., & McDaniel, P. D. (2007) · Cited by 34
A security-preserving compiler for distributed programs
Cédric Fournet, A., Guernic, G. L., & Rezk, T. (2009) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1653662.1653715 · Cited by 34
Policy-Driven Memory Protection for Reconfigurable Hardware
Huffmire, T., Prasad, S., Sherwood, T., & Kastner, R. (2006) · Lecture notes in computer science · doi:10.1007/11863908_28 · Cited by 34
Information Flow in Operating Systems: Eager Formal Methods
Guttman, J. D., Herzog, A. L., & Ramsdell, J. D. (2003) · Cited by 34
Security Types Preserving Compilation
Barthe, G., Basu, A., & Rezk, T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24622-0_2 · Cited by 34
Blanchette, J. C., Popescu, A., Wand, D., & Weidenbach, C. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32347-8_24 · Cited by 33
Hypercollecting semantics and its application to static analysis of information flow
Assaf, M., Naumann, D. A., Signoles, J., Totel, É., & Tronel, F. (2016) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/3009837.3009889 · Cited by 33
Experiences with PDG-Based IFC
Hammer, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11747-3_4 · Cited by 33
Zanioli, M., Ferrara, P., & Cortesi, A. (2012) · ACM Symposium on Applied Computing · doi:10.1145/2245276.2231983 · Cited by 33
Secure information flow with random assignment and encryption
Smith, G., & Alpízar, R. (2006) · doi:10.1145/1180337.1180341 · Cited by 33
Translating dependency into parametricity
Tse, S., & Zdancewic, S. (2004) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/1016850.1016868 · Cited by 33
Value-Sensitive Hybrid Information Flow Control for a JavaScript-Like Language
Hedin, D. S., Bello, L., & Sabelfeld, A. (2015) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2015.31 · Cited by 32
Self-citationGodefroid, P., & Kinder, J. (2010) · International Symposium on Software Testing and Analysis · doi:10.1145/1831708.1831710 · Cited by 32
Type-directed automatic incrementalization
Chen, Y., Dunfield, J., & Acar, U. A. (2012) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2254064.2254100 · Cited by 32
Harley, K., & Cooper, R. H. (2021) · ACM Computing Surveys · doi:10.1145/3436817 · Cited by 36
ENCoVer: Symbolic Exploration for Information Flow Security
Balliu, M., Dam, M., & Guernic, G. L. (2012) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2012.24 · Cited by 32
Security of multithreaded programs by compilation
Barthe, G., Rezk, T., Russo, A., & Sabelfeld, A. (2010) · ACM Transactions on Information and System Security · doi:10.1145/1805974.1805977 · Cited by 32
Self-citationRefactoring programs to secure information flows
Smith, S. F., & Thober, M. (2006) · ACM Workshop on Programming Languages and Analysis for Security · doi:10.1145/1134744.1134758 · Cited by 32
Gamiz, I., Regueiro, C., Lage, Ó., Jacob, E., & Astorga, J. (2024) · International Journal of Information Security · doi:10.1007/s10207-024-00939-4 · Cited by 31
Lightweight monadic programming in ML
Swamy, N., Guts, N., Leijen, D., & Hicks, M. (2011) · ACM SIGPLAN Notices · doi:10.1145/2034574.2034778 · Cited by 31
Algorithms and tool support for dynamic information flow analysis
Masri, W., & Podgurski, A. (2008) · Information and Software Technology · doi:10.1016/j.infsof.2008.05.008 · Cited by 31
Butler, K. R. B., McLaughlin, S., & McDaniel, P. D. (2008) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1455770.1455821 · Cited by 31
Information leak detection in business process models: Theory, application, and tool support
Accorsi, R., Lehmann, A., & Lohmann, N. (2014) · Information Systems · doi:10.1016/j.is.2013.12.006 · Cited by 31
Achieving Information Flow Security through Precise Control of Effects
Harrison, W. L., & Hook, J. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2005.6 · Cited by 31
An Empirical Study of Information Flows in Real-World JavaScript
Staicu, C.-A., Schoepe, D., Balliu, M., Pradel, M., & Sabelfeld, A. (2019) · doi:10.1145/3338504.3357339 · Cited by 31
Self-citationCoverage Maximization Using Dynamic Taint Tracing
Leek, T. R., Baker, G. Z., Brown, R. E., Zhivich, M., & Lippmann, R. P. (2007) · Cited by 31
On the computational soundness of cryptographically masked flows
Laud, P. (2008) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1328438.1328479 · Cited by 31
Inference of Expressive Declassification Policies
Vaughan, J. A., & Chong, S. (2011) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2011.20 · Cited by 30
Verifying Constant-Time Implementations by Abstract Interpretation
Blazy, S., Pichardie, D., & Trieu, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-66402-6_16 · Cited by 30
LWeb: information flow security for multi-tier web applications
Parker, J., Vazou, N., & Hicks, M. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3290388 · Cited by 30
An Information Flow Monitor-Inlining Compiler for Securing a Core of JavaScript
Santos, J. F., & Rezk, T. (2014) · IFIP advances in information and communication technology · doi:10.1007/978-3-642-55415-5_23 · Cited by 30
Olijnyk, N. V. (2015) · Scientometrics · doi:10.1007/s11192-015-1708-1 · Cited by 35
Type-Based Analysis of PIN Processing APIs
Centenaro, M., Riccardo Focardi, A., Luccio, F. L., & Steel, G. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04444-1_4 · Cited by 30
Security for Multithreaded Programs Under Cooperative Scheduling
Russo, A., & Sabelfeld, A. (2007) · Springer eBooks · doi:10.1007/978-3-540-70881-0_43 · Cited by 30
Self-citationA Typed Assembly Language for Non-interference
Medel, R., Compagnoni, A. B., & Bonelli, E. (2005) · Lecture notes in computer science · doi:10.1007/11560586_29 · Cited by 30
The MOBIUS Proof Carrying Code Infrastructure
Barthe, G., Crégut, P., Grégoire, B., Jensen, T. W., & Pichardie, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92188-2_1 · Cited by 30
Information flow enforcement in monadic libraries
Devriese, D., & Piessens, F. (2011) · Types In Languages Design And Implementation · doi:10.1145/1929553.1929564 · Cited by 30
James, R. P., & Sabry, A. (2012) · ACM SIGPLAN Notices · doi:10.1145/2103621.2103667 · Cited by 30
Attacker Control and Impact for Confidentiality and Integrity
Askarov, A., & Myers, A. (2011) · Logical Methods in Computer Science · doi:10.2168/lmcs-7(3:17)2011 · Cited by 30
Self-citationPrivacy Scope: A Precise Information Flow Tracking System For Finding Application Leaks
Zhu, Y., Jung, J., Song, D., Kohno, T., & Wetherall, D. J. (2009) · UC Berkeley · Cited by 30
Schoepe, D., Hedin, D. S., & Sabelfeld, A. (2014) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/2628136.2628151 · Cited by 29
Self-citationJames, R. P., & Sabry, A. (2012) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2103656.2103667 · Cited by 29
A new algorithm for low-deterministic security
Giffhorn, D., & Snelting, G. (2014) · International Journal of Information Security · doi:10.1007/s10207-014-0257-6 · Cited by 29
Metadata
- Authors
- Sabelfeld, A., & Myers, A. C.
- Affiliations
- Cornell University (US)
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2003-01
- Volume
- 21
- Issue
- 1
- Pages
- 5-19
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2122049982
- Cited by
- 1,907
- References
- 164
- Citations by year
- 2026: 29 · 2025: 38 · 2024: 45 · 2023: 43 · 2022: 50 · 2021: 65 · 2020: 56 · 2019: 87 · 2018: 67 · 2017: 83 · 2016: 77 · 2015: 101 · 2014: 135 · 2013: 105 · 2012: 122
- FWCI
- 97.28
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Journal on Selected Areas in Communications (publishedVersion)
- Funders
- Alfred P. Sloan Foundation
- Topics
- Physical Sciences › Computer Science › Hardware and Architecture › Security and Verification in Computing
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Keywords
- information flow security, confidentiality, static analysis, information flow policies, programming languages, policy enforcement, end-to-end security, open problems
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