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,387
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,885
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,813
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
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,259
Enck (2014) · doi:10.1145/2619091 · Cited by 1,203
Schwartz, E. J., Avgerinos, T., & Brumley, D. (2010) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2010.26 · Cited by 727
Sampson, A., Dietl, W., Fortuna, E., Gnanapragasam, D., Ceze, L., & Grossman, D. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993518 · Cited by 589
On the Foundations of Quantitative Information Flow
Smith, G. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00596-1_21 · Cited by 571
Securing web application code by static analysis and runtime protection
Huang, Y., Yu, F., Hang, C., Tsai, C.-H., Lee, D.-T., & Kuo, S. (2004) · International World Wide Web Conference (WWW) · doi:10.1145/988672.988679 · Cited by 579
Cross Site Scripting Prevention with Dynamic Data Tainting and Static Analysis.
Vogt, P.-S., Nentwich, F., Jovanovic, N. M., Kirda, E., Krügel, C., & Vigna, G. (2007) · Network and Distributed System Security Symposium · Cited by 483
Airavat: security and privacy for MapReduce
Roy, I., Setty, S., Kilzer, A., Shmatikov, V., & Witchel, E. (2010) · doi:10.5555/1855711.1855731 · Cited by 417
Verification and change-impact analysis of access-control policies
Fisler, K., Krishnamurthi, S., Meyerovich, L. A., & Tschantz, M. C. (2005) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/1062455.1062502 · Cited by 395
Sampson, A., Dietl, W., Fortuna, E., Gnanapragasam, D., Ceze, L., & Grossman, D. (2011) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1993498.1993518 · Cited by 390
Automatically Hardening Web Applications Using Precise Tainting
Nguyen‐Tuong, A., Guarnieri, S., Greene, D., Shirley, J. J., & Evans, D. (2005) · IFIP advances in information and communication technology · doi:10.1007/0-387-25660-1_20 · Cited by 389
Analyzing Memory Accesses in x86 Executables
Balakrishnan, G., & Reps, T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24723-4_2 · Cited by 378
Anderson, C. J., Foster, N., Guha, A., Jeannin, J.-B., Kozen, D. C., Schlesinger, C., & Walker, D. (2014) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2535838.2535862 · Cited by 371
Automatic creation of SQL Injection and cross-site scripting attacks
Kieyzun, A., Guo, P. J., Jayaraman, K., & Ernst, M. D. (2009) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse.2009.5070521 · Cited by 345
Taint-enhanced policy enforcement: a practical approach to defeat a wide range of attacks
Xu, W., Bhatkar, S., & Sekar, R. (2006) · Cited by 339
Separating agreement from execution for byzantine fault tolerant services
Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., & Dahlin, M. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945470 · Cited by 312
A survey on provenance: What for? What form? What from?
Herschel, M., Diestelkämper, R., & Ben Lahmar, H. (2017) · The VLDB Journal · doi:10.1007/s00778-017-0486-1 · Cited by 300
Temporal Logics for Hyperproperties
Clarkson, M. R., Finkbeiner, B., Koleini, M., Micinski, K., Rabe, M. N., & Sánchez, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54792-8_15 · Cited by 283
Secure Information Flow as a Safety Problem
Terauchi, T., & Aiken, A. (2005) · Lecture notes in computer science · doi:10.1007/11547662_24 · Cited by 277
Observational determinism for concurrent program security
Zdancewic, S., & Myers, A. C. (2004) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2003.1212703 · Cited by 273
Self-citationRIFLE: An Architectural Framework for User-Centric Information-Flow Security
Vachharajani, N., Bridges, M. J., Chang, J., Rangan, R., Ottoni, G. D. L., Blome, J. A., Reis, G. A., Vachharajani, M., & August, D. I. (2005) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.2004.31 · Cited by 279
Dimensions and Principles of Declassification
Sabelfeld, A., & Sands, D. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2005.15 · Cited by 265
Self-citationBurow, N., Carr, S., Nash, J., Larsen, P., Franz, M., Brunthaler, S., & Payer, M. (2017) · ACM Computing Surveys · doi:10.1145/3054924 · Cited by 258
Noninterference through Secure Multi-execution
Devriese, D., & Piessens, F. (2010) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2010.15 · Cited by 245
Declassification: Dimensions and principles
Sabelfeld, A., & Sands, D. (2009) · Journal of Computer Security · doi:10.3233/jcs-2009-0352 · Cited by 228
Self-citationDynamic Taint Propagation for Java
Haldar, V., Chandra, D., & Franz, M. M. (2006) · Annual Computer Security Applications Conference · doi:10.1109/csac.2005.21 · Cited by 227
Secure information flow by self-composition
Barthe, G., D’Argenio, P. R., & Rezk, T. (2004) · doi:10.1109/csfw.2004.17 · Cited by 228
On flow-sensitive security types
Hunt, S., & Sands, D. (2006) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1111037.1111045 · Cited by 210
Giacobazzi, R., & Mastroeni, I. (2004) · ACM Transactions on Privacy and Security · doi:10.1145/3175660 · Cited by 208
Automatic Discovery and Quantification of Information Leaks
Michael Backes, A., Köpf, B., & Rybalchenko, A. (2009) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2009.18 · Cited by 206
seL4: From General Purpose to a Proof of Information Flow Enforcement
Murray, T., Matichuk, D., Brassil, M., Gammie, P., Bourke, T., Seefried, S., Lewis, C., Gao, X., & Klein, G. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.35 · Cited by 205
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 205
Hammer, C., & Snelting, G. (2009) · International Journal of Information Security · doi:10.1007/s10207-009-0086-1 · Cited by 205
Molnár, D., Piotrowski, M., Schultz, D., & Wagner, D. (2006) · Lecture notes in computer science · doi:10.1007/11734727_14 · Cited by 198
Automatic Inference of Search Patterns for Taint-Style Vulnerabilities
Yamaguchi, F., Maier, A., Gascón, H., & Rieck, K. (2015) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2015.54 · Cited by 196
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
Self-citationEfficient purely-dynamic information flow analysis
Austin, T. H., & Cormac Flanagan, A. (2009) · ACM Workshop on Programming Languages and Analysis for Security · doi:10.1145/1554339.1554353 · Cited by 195
Dynamic vs. Static Flow-Sensitive Security Analysis
Russo, A., & Sabelfeld, A. (2010) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2010.20 · Cited by 190
Self-citationSecure information flow by self-composition
Barthe, G., D’Argenio, P. R., & Rezk, T. (2004) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2004.1310735 · Cited by 183
Raccoon: closing digital side-channels through obfuscated execution
Rane, A., Lin, C., & Tiwari, M. (2015) · Cited by 182
Aegis: A Single-Chip Secure Processor
Suh, G. E., O'Donnell, C. W., & Devadas, S. (2007) · IEEE Design & Test of Computers · doi:10.1109/mdt.2007.179 · Cited by 179
Automatic proof of strong secrecy for security protocols
Blanchet, B. (2004) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2004.1301317 · Cited by 172
Secure information flow by self-composition
Barthe, G., D’Argenio, P. R., & Rezk, T. (2011) · Mathematical Structures in Computer Science · doi:10.1017/s0960129511000193 · Cited by 178
AppContext: Differentiating Malicious and Benign Mobile App Behaviors Using Context
Yang, W. M., Xiao, X., Andow, B., Li, S., Xie, T., & Enck, W. (2015) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse.2015.50 · Cited by 167
Bisht, P., Madhusudan, P., & Venkatakrishnan, V. N. (2010) · ACM Transactions on Information and System Security · doi:10.1145/1698750.1698754 · Cited by 166
Downgrading policies and relaxed noninterference
Li, P., & Zdancewic, S. (2005) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1040305.1040319 · Cited by 165
Ethainter: a smart contract security analyzer for composite vulnerabilities
Brent, L., Grech, N., Lagouvardos, S., Scholz, B., & Smaragdakis, Y. (2020) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3385412.3385990 · Cited by 164
Tucek, J. A., Lu, S., Huang, C., Xanthos, S., & Zhou, Y. (2007) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/1294261.1294275 · Cited by 163
Cloud Data Protection for the Masses
Song, D., Shi, E., Fischer, I. T., & Shankar, U. (2012) · Computer · doi:10.1109/mc.2012.1 · Cited by 162
Zhu, D. (., Jung, J., Song, D. X., Kohno, T., & Wetherall, D. J. (2011) · ACM SIGOPS Operating Systems Review · doi:10.1145/1945023.1945039 · Cited by 161
Gradual Release: Unifying Declassification, Encryption and Key Release Policies
Askarov, A., & Sabelfeld, A. (2007) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2007.22 · Cited by 160
Self-citationIronclad apps: end-to-end security via automated full-system verification
Hawblitzel, C., Howell, J., Lorch, J. R., Narayan, A., Parno, B. J., Zhang, D., & Zill, B. (2014) · Operating Systems Design and Implementation · doi:10.5555/2685048.2685062 · Cited by 159
Criswell, J., Lenharth, A., Dhurjati, D., & Adve, V. (2007) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/1294261.1294295 · Cited by 164
Consistency Analysis in Bloom: a CALM and Collected Approach
Alvaro, P., Conway, N., Hellerstein, J. M., & Marczak, W. R. (2011) · Cited by 157
Multiple facets for dynamic information flow
Austin, T. H., & Cormac Flanagan, A. (2012) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2103656.2103677 · Cited by 156
Bandhakavi, S., Bisht, P., Madhusudan, P., & Venkatakrishnan, V. N. (2007) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1315245.1315249 · Cited by 154
Verified Proofs of Higher-Order Masking
Barthe, G., Belaïd, S., Dupressoir, F., Fouque, P.-A., Grégoire, B., & Strub, P.-Y. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46800-5_18 · Cited by 152
Detecting and Removing Web Application Vulnerabilities with Static Analysis and Data Mining
Medeiros, I., Neves, N., & Correia, M. P. (2015) · IEEE Transactions on Reliability · doi:10.1109/tr.2015.2457411 · Cited by 150
Doychev, G., Köpf, B., Mauborgne, L., & Reineke, J. (2015) · ACM Transactions on Information and System Security · doi:10.1145/2756550 · Cited by 150
Analysis of information flow security in cyber–physical systems
Akella, R., Tang, H., & McMillin, B. (2010) · International Journal of Critical Infrastructure Protection · doi:10.1016/j.ijcip.2010.09.001 · Cited by 148
Hedin, D. S., Birgisson, A., Bello, L., & Sabelfeld, A. (2014) · ACM Symposium on Applied Computing · doi:10.1145/2554850.2554909 · Cited by 148
Self-citationInformation-Flow Security for a Core of JavaScript
Hedin, D. S., & Sabelfeld, A. (2012) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2012.19 · Cited by 147
Self-citationFlexible dynamic information flow control in Haskell
Stefan, D., Russo, A., Mitchell, J. C., & Mazières, D. (2011) · doi:10.1145/2034675.2034688 · Cited by 145
A Hardware Design Language for Timing-Sensitive Information-Flow Security
Zhang, D., Wang, Y., Suh, G. E., & Myers, A. C. (2015) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/2694344.2694372 · Cited by 145
Self-citationSIF: enforcing confidentiality and integrity in web applications
Chong, S., Vikram, K., & Myers, A. C. (2007) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 144
Self-citationThe taser intrusion recovery system
Goel, A., Po, K., Farhadi, K., Li, Z., & de Lara, E. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095826 · Cited by 143
Livshits, B., Nori, A. V., Rajamani, S. K., & Banerjee, A. (2009) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1542476.1542485 · Cited by 142
Efficient path conditions in dependence graphs for software safety analysis
Snelting, G., Robschink, T., & Krinke, J. (2006) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/1178625.1178628 · Cited by 140
Stack-based access control and secure information flow
Banerjee, A., & Naumann, D. A. (2005) · Journal of Functional Programming · doi:10.1017/s0956796804005453 · Cited by 144
On the Limits of Information Flow Techniques for Malware Analysis and Containment
Cavallaro, L., Saxena, P., & Sekar, R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70542-0_8 · Cited by 141
Quantitative Information Flow, Relations and Polymorphic Types
Clark, D. (2005) · Journal of Logic and Computation · doi:10.1093/logcom/exi009 · Cited by 138
Multiple facets for dynamic information flow
Austin, T. H., & Cormac Flanagan, A. (2012) · ACM SIGPLAN Notices · doi:10.1145/2103621.2103677 · Cited by 138
Tight Enforcement of Information-Release Policies for Dynamic Languages
Askarov, A., & Sabelfeld, A. (2009) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2009.22 · Cited by 137
Self-citationBater, J., Elliott, G., Eggen, C., Goel, S., Kho, A. N., & Rogers, J. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3055330.3055334 · Cited by 136
Andromeda: Accurate and Scalable Security Analysis of Web Applications
Tripp, O., Pistoia, M., Cousot, P. M., Cousot, R., & Guarnieri, S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37057-1_15 · Cited by 135
Roy, I., Porter, D. E., Bond, M. D., McKinley, K. S., & Witchel, E. (2009) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1542476.1542484 · Cited by 134
Groef, W. D., Devriese, D., Nikiforakis, N., & Piessens, F. (2012) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2382196.2382275 · Cited by 133
Efficient and extensible security enforcement using dynamic data flow analysis
Chang, W., Streiff, B., & Lin, C. (2008) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1455770.1455778 · Cited by 132
Dantas, D. S., & Walker, D. (2006) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1111037.1111071 · Cited by 131
Permissive dynamic information flow analysis
Austin, T. H., & Cormac Flanagan, A. (2010) · ACM Workshop on Programming Languages and Analysis for Security · doi:10.1145/1814217.1814220 · Cited by 130
Separating agreement from execution for byzantine fault tolerant services
Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., & Dahlin, M. (2003) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/945445.945470 · Cited by 129
A logic for information flow in object-oriented programs
Amtoft, T., Bandhakavi, S., & Banerjee, A. (2006) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1111037.1111046 · Cited by 129
Language-based control and mitigation of timing channels
Zhang, D., Askarov, A., & Myers, A. C. (2012) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2254064.2254078 · Cited by 126
Self-citationSome Recipes Can Do More Than Spoil Your Appetite
Surbatovich, M., Aljuraidan, J., Bauer, L., Das, A., & Jia, L. (2017) · International World Wide Web Conference (WWW) · doi:10.1145/3038912.3052709 · Cited by 125
Assessing and Improving Malware Detection Sustainability through App Evolution Studies
Cai, H. (2020) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3371924 · Cited by 124
Automata-Based Confidentiality Monitoring
Guernic, G. L., Banerjee, A., Jensen, T. W., & Schmidt, D. A. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77505-8_7 · Cited by 123
Speculative Taint Tracking (STT)
Yu, J., Yan, M., Khyzha, A., Morrison, A., Torrellas, J., & Fletcher, C. W. (2019) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3352460.3358274 · Cited by 122
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
Anderson, C. J., Foster, N., Guha, A., Jeannin, J.-B., Kozen, D. C., Schlesinger, C., & Walker, D. (2014) · ACM SIGPLAN Notices · doi:10.1145/2578855.2535862 · Cited by 118
Cartesian hoare logic for verifying k-safety properties
Sousa, M., & Dillig, I. (2016) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2908080.2908092 · Cited by 117
Li, X., Kashyap, V., Oberg, J. K., Tiwari, M., Rajarathinam, V. R., Kastner, R., Sherwood, T., Hardekopf, B., & Chong, F. T. (2014) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/2541940.2541947 · Cited by 116
Digital twins, big data governance, and sustainable tourism
Rahmadian, E., Feitosa, D., & Virantina, Y. (2023) · Ethics and Information Technology · doi:10.1007/s10676-023-09730-w · Cited by 116
The taser intrusion recovery system
Goel, A., Po, K., Farhadi, K., Li, Z., & de Lara, E. (2005) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/1095810.1095826 · Cited by 116
From Dynamic to Static and Back: Riding the Roller Coaster of Information-Flow Control Research
Sabelfeld, A., & Russo, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11486-1_30 · Cited by 115
Self-citationLiu, C., Harris, A., Maas, M., Hicks, M., Tiwari, M., & Shi, E. (2015) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/2694344.2694385 · Cited by 114
Clarkson, M. R., & Schneider, F. B. (2008) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2008.7 · Cited by 114
Using replication and partitioning to build secure distributed systems
Zheng, L., Chong, S., Myers, A. C., & Zdancewic, S. (2004) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/secpri.2003.1199340 · Cited by 113
Self-citationFable: A Language for Enforcing User-defined Security Policies
Swamy, N., Corcoran, B. J., & Hicks, M. (2008) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2008.29 · Cited by 112
Tightlip: keeping applications from spilling the beans
Yumerefendi, A. R., Mickle, B., & Cox, L. P. (2007) · Cited by 110
CacheAudit: A Tool for the Static Analysis of Cache Side Channels.
Doychev, G., Feld, D., Köpf, B., Mauborgne, L., & Reineke, J. (2013) · Cited by 109
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