Scaling static analyses at Facebook
Open accessThe DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Abstract
Key lessons for designing static analyses tools deployed to find bugs in hundreds of millions of lines of code.
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
Figures





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.
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?
The cited source says what the claim attributes to it.
In the citing paper
“industry reports show that it is difficult to get developers to adopt static analysis in their workflows [5, 11, 30, 34].”
From Position: Vibe Coding Needs Vibe Reasoning: Improving Vibe Coding with Formal Verification (2025) · cites this paper as [5]
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
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 · cited 2×
“More formally, the designer of the static analysis defines an appropriate mathematical structure, called the abstract domain [7], which allows to approximate this large function space much more succinctly.”
BackgroundA few billion lines of code later: using static analysis to find bugs in the real world
Bessey, A., Block, K., Chelf, B., Chou, A., Fulton, B., Hallem, S., Henri-Gros, C., Kamsky, A., McPeak, S., & Engler, D. (2010) · Communications of the ACM · doi:10.1145/1646353.1646374 · Cited by 635
Static detection of security vulnerabilities in scripting languages
Xie, Y., & Aiken, A. (2006) · Cited by 366
Disruption and recovery of computing tasks: field study, analysis, and directions
Iqbal, S. T., & Horvitz, E. (2007) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1240624.1240730 · Cited by 300
Moving Fast with Software Verification
Calcagno, C., Distefano, D., Dubreil, J., Gabi, D., Hooimeijer, P., Luca, M., O’Hearn, P., Papakonstantinou, I., Purbrick, J., & Rodriguez, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-17524-9_1 · Cited by 261
Self-citationDevelopment and Deployment at Facebook
Feitelson, D. G., Frachtenberg, E., & Beck, K. L. (2013) · IEEE Internet Computing · doi:10.1109/mic.2013.25 · Cited by 243
Lessons from building static analysis tools at Google
Sadowski, C., Aftandilian, E., Eagle, A., Miller-Cushon, L., & Jaspan, C. (2018) · Communications of the ACM · doi:10.1145/3188720 · Cited by 242
Compositional Shape Analysis by Means of Bi-Abduction
Calcagno, C., Distefano, D., O’Hearn, P. W., & Yang, H. (2011) · Journal of the ACM · doi:10.1145/2049697.2049700 · Cited by 212 · cited 3×
“Infer (Section 4) deploys one analysis based on the theory of Separation Logic [16], with a novel theorem prover that implements an inference technique that guesses assumptions [5].”
BackgroundMethodSelf-citationModular Static Program Analysis
Cousot, P., & Cousot, R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45937-5_13 · Cited by 163 · cited 1×
“The same idea can be applied to program analysis [8, 5].”
BackgroundFrom Start-ups to Scale-ups: Opportunities and Open Problems for Static and Dynamic Program Analysis
Harman, M., & O'Hearn, P. (2018) · 2018 IEEE 18th International Working Conference on Source Code Analysis and Manipulation (SCAM) · doi:10.1109/scam.2018.00009 · Cited by 151
Self-citationContinuous Reasoning: Scaling the impact of formal methods
O’Hearn, P. W. (2018) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1145/3209108.3209109 · Cited by 119 · cited 1×
“, Infer is used at other companies such as Amazon, Mozilla and Spotify, we have produced new scientific results [2, 10], and proposed new scientific problems [14, 11].”
BackgroundSelf-citationO’Hearn, P. W. (2019) · Communications of the ACM · doi:10.1145/3211968 · Cited by 116 · cited 1×
“Infer, as we will discuss, uses one analysis based on the theory of Separation Logic, 16 with a novel theorem prover that implements an inference technique that guesses assumptions.”
MethodSelf-citationFormal Reasoning About the Security of Amazon Web Services
Cook, B. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-96145-3_3 · Cited by 105 · cited 1×
“, [17, 6, 1, 13]), and hope that such perspectives can provide input both to future research and to further industrial use of static analysis.”
BackgroundBrookes, S. D., & O’Hearn, P. W. (2016) · ACM SIGLOG News · doi:10.1145/2984450.2984457 · Cited by 99 · cited 2×
“Development of the analysis started in early 2016, motivated by Concurrent Separation Logic [3].”
MethodSelf-citationLarus, J. R., Ball, T., Das, M., DeLine, R., Fahndrich, M., Pincus, J., Rajamani, S. K., & Venkatapathy, R. (2004) · IEEE Software · doi:10.1109/ms.2004.1293079 · Cited by 96 · cited 1×
“, [17, 6, 1, 13]), and hope that such perspectives can provide input both to future research and to further industrial use of static analysis.”
BackgroundSelf-citationRacerD: compositional static race detection
Blackshear, S., Gorogiannis, N., O’Hearn, P. W., & Sergey, I. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3276514 · Cited by 89 · cited 6×
“As of March 2018, no Android data race bugs missed by Infer had been observed in the previous year (modulo 3 analyzer implementation errors [2]).”
BackgroundInfluentialSelf-citationGenerating precise and concise procedure summaries
Yorsh, G., Yahav, E., & Chandra, S. (2008) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1328438.1328467 · Cited by 67
A true positives theorem for a static race detector
Gorogiannis, N., O’Hearn, P. W., & Sergey, I. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3290370 · Cited by 36 · cited 3×
“Another Infer analysis involves recently published research results on concurrency analysis [2, 10].”
BackgroundSelf-citationExperience Developing and Deploying Concurrency Analysis at Facebook
O’Hearn, P. W. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-99725-4_5 · Cited by 9 · cited 2×
“Concurrency A concurrency capability recently added to Infer, the RacerD analysis, provides an example of the benefit of feedback between program analysis researchers and product engineers [2, 15].”
BackgroundSelf-citation
Cited by
AI and the Future of Skills, Volume 1: Capabilities and Assessments
OECD (2021) · Educational research and innovation · doi:10.1787/5ee71f34-en · Cited by 307
Security Weaknesses of Copilot-Generated Code in GitHub Projects: An Empirical Study
Fu, Y., Liang, P., Tahir, A., Li, Z., Shahin, M., Yu, J., & Chen, J. (2025) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3716848 · Cited by 74
“Static security analysis tools have been widely used by developers and companies [13, 63].”
Security Weaknesses of Copilot-Generated Code in GitHub Projects: An Empirical Study
Fu, Y., Liang, P., Tahir, A., Li, Z., Shahin, M., Yu, J., & Chen, J. (2023) · arXiv · doi:10.48550/arxiv.2310.02059 · Cited by 75
“Static security analysis tools have been widely used by developers and companies [13, 63].”
Local Reasoning About the Presence of Bugs: Incorrectness Separation Logic
Raad, A., Berdine, J., Dang, H.-H., Dreyer, D. R., O’Hearn, P. W., & Villard, J. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-53291-8_14 · Cited by 118
Self-citationter Beek, M. H., Chapman, R., Cleaveland, R., Garavel, H., Gu, R., ter Horst, I., Keiren, J. J. A., Lecomte, T., Leuschel, M., Rozier, K. Y., et al. (2024) · Formal Aspects of Computing · doi:10.1145/3689374 · Cited by 97
Metadata
- Authors
- Distefano, D., Fähndrich, M., Logozzo, F., & O'Hearn, P. W.
- Affiliations
- Queen Mary University of London (GB)
- Meta (United States) (US)
- Facebook London, U.K and University College London, U.K
- Venue
- Communications of the ACM
- Published
- 2019-07-24
- Volume
- 62
- Issue
- 8
- Pages
- 62-70
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2964232059
- Cited by
- 212
- References
- 19
- Citations by year
- 2026: 22 · 2025: 25 · 2024: 28 · 2023: 34 · 2022: 35 · 2021: 43 · 2020: 24 · 2019: 1
- FWCI
- 61.88
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- Communications of the ACM (publishedVersion, cc-by)
- UCL Discovery (University College London) (submittedVersion)
- Queen Mary Research Online (Queen Mary University of London) (submittedVersion)
- Funders
- Engineering and Physical Sciences Research Council (EP/R006865/1)
- Topics
- Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Keywords
- static analysis, software defect detection, scalability, large software systems, software quality tools, Facebook
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.