{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,21]],"date-time":"2026-11-21T19:43:51Z","timestamp":1795290231601,"version":"4.10.3"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA","license":[{"start":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T00:00:00Z","timestamp":1540339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2018,10,24]]},"abstract":"<jats:p>Automatic static detection of data races is one of the most basic problems in reasoning about concurrency. We present RacerD\u2014a static program analysis for detecting data races in Java programs which is fast, can scale to large code, and has proven effective in an industrial software engineering scenario. To our knowledge, RacerD is the first inter-procedural, compositional data race detector which has been shown to have non-trivial precision and impact. Due to its compositionality, it can analyze code changes quickly, and this allows it to perform continuous reasoning about a large, rapidly changing codebase as part of deployment within a continuous integration ecosystem. In contrast to previous static race detectors, its design favors reporting high-confidence bugs over ensuring their absence. RacerD has been in deployment for over a year at Facebook, where it has flagged over 2500 issues that have been fixed by developers before reaching production. It has been important in enabling the development of new code as well as fixing old code: it helped support conversion of part of the main Facebook Android app from a single-threaded to a multi-threaded architecture. In this paper we describe RacerD\u2019s design, implementation, deployment and impact.<\/jats:p>","DOI":"10.1145\/3276514","type":"journal-article","created":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T11:57:18Z","timestamp":1540382238000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":84,"title":["RacerD: compositional static race detection"],"prefix":"10.1145","volume":"2","author":[{"given":"Sam","family":"Blackshear","sequence":"first","affiliation":[{"name":"Facebook, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikos","family":"Gorogiannis","sequence":"additional","affiliation":[{"name":"Facebook, UK \/ Middlesex University, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter W.","family":"O'Hearn","sequence":"additional","affiliation":[{"name":"Facebook, UK \/ University College London, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ilya","family":"Sergey","sequence":"additional","affiliation":[{"name":"Yale-NUS College, Singapore \/ University College London, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,10,24]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"ThreadSafe: Static Analysis for Java Concurrency. ECEASST 72","author":"Atkey Robert","year":"2015"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2008.130"},{"key":"e_1_2_2_3_1","volume-title":"Declaration. Available online: https:\/\/www.cs.umd.edu\/~pugh\/java\/memoryModel\/DoubleCheckedLocking.html . (July","author":"Bacon David","year":"2012"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1646353.1646374"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814303"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167488"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2984450.2984457"},{"key":"e_1_2_2_8_1","volume-title":"Infer: An Automatic Program Verifier for Memory Safety of C Programs. In NASA Formal Methods (LNCS)","author":"Calcagno Cristiano","year":"2011"},{"key":"e_1_2_2_9_1","volume-title":"NASA Formal Methods (LNCS)","author":"Calcagno Cristiano"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049700"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/320384.320386"},{"key":"e_1_2_2_12_1","unstructured":"Andy Chou. 2014. From the Trenches: Static Analysis in Industry. (2014). Invited keynote talk at POPL\u201914. Available at https:\/\/popl.mpi-sws.org\/2014\/andy.pdf .  Andy Chou. 2014. From the Trenches: Static Analysis in Industry. (2014). Invited keynote talk at POPL\u201914. Available at https:\/\/popl.mpi-sws.org\/2014\/andy.pdf ."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/582419.582447"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_2"},{"key":"e_1_2_2_15_1","unstructured":"Ernie Cohen Michal Moskal Wolfram Schulte and Stephan Tobies. 2008. A Practical Verification Methodology for Concurrent Programs. (2008).  Ernie Cohen Michal Moskal Wolfram Schulte and Stephan Tobies. 2008. A Practical Verification Methodology for Concurrent Programs. (2008)."},{"key":"e_1_2_2_16_1","unstructured":"Coq Development Team. 2018. The Coq Proof Assistant Reference Manual - Version 8.8.  Coq Development Team. 2018. The Coq Proof Assistant Reference Manual - Version 8.8."},{"key":"e_1_2_2_17_1","volume-title":"Kristoffer Just Andersen, and Lars Birkedal.","author":"Dinsdale-Young Thomas","year":"2017"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945468"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884882"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2126"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542490"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040315"},{"key":"e_1_2_2_23_1","volume-title":"Java Concurrency in Practice","author":"Goetz Brian"},{"key":"e_1_2_2_24_1","volume-title":"International Working Conference on Source Code Analysis and Manipulation .","author":"Harman Mark"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2014.34"},{"key":"e_1_2_2_26_1","volume-title":"Sound, Predictable, Fast Verifier for C and Java. In NASA Formal Methods (LNCS)","author":"Jacobs Bart"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567776"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009855"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192390"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594311"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2931037.2931054"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49122-5_2"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134018"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209109"},{"key":"e_1_2_2_35_1","volume-title":"SAS (LNCS)","author":"O\u2019Hearn Peter W."},{"key":"e_1_2_2_36_1","volume-title":"Johns Hopkins APL Technical Digest","volume":"32","author":"Pendergrass J. Aaron","year":"2013"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192417"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188720"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1791194.1791203"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737964"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1561\/2500000014"},{"key":"e_1_2_2_42_1","volume-title":"SAS (LNCS)","author":"Spoto Fausto"},{"key":"e_1_2_2_43_1","volume-title":"Fearless Concurrency with Rust. (10","author":"Turon Aaron","year":"2015"},{"key":"e_1_2_2_44_1","volume-title":"Parkinson","author":"Windsor Matt","year":"2017"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3276514","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3276514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:39Z","timestamp":1750273419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3276514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,24]]},"references-count":44,"journal-issue":{"issue":"OOPSLA","published-print":{"date-parts":[[2018,10,24]]}},"alternative-id":["10.1145\/3276514"],"URL":"https:\/\/doi.org\/10.1145\/3276514","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,24]]},"assertion":[{"value":"2018-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}