A true positives theorem for a static race detector
Conference paper
Gkorogiannis, N., O'Hearn, P. and Sergey, I. 2019. A true positives theorem for a static race detector. POPL 2019. Cascais, Portugal 12 - 19 Jan 2019 Association for Computing Machinery (ACM). pp. 1-29 https://doi.org/10.1145/3290370
Type | Conference paper |
---|---|
Title | A true positives theorem for a static race detector |
Authors | Gkorogiannis, N., O'Hearn, P. and Sergey, I. |
Abstract | RacerD is a static race detector that has been proven to be effective in engineering practice: it has seen thousands of data races fixed by developers before reaching production, and has supported the migration of Facebook's Android app rendering infrastructure from a single-threaded to a multi-threaded architecture. We prove a True Positives Theorem stating that, under certain assumptions, an idealized theoretical version of the analysis never reports a false positive. We also provide an empirical evaluation of an implementation of this analysis, versus the original RacerD. |
Research Group | Foundations of Computing group |
Conference | POPL 2019 |
Page range | 1-29 |
Proceedings Title | Proceedings of the ACM on Programming Languages |
ISSN | 2475-1421 |
Electronic | 2475-1421 |
Publisher | Association for Computing Machinery (ACM) |
Publication dates | |
02 Jan 2019 | |
Publication process dates | |
Deposited | 27 Apr 2020 |
Accepted | 01 Jul 2018 |
Output status | Published |
Publisher's version | License File Access Level Open |
Copyright Statement | © 2019 Copyright held by the owner/author(s). |
Digital Object Identifier (DOI) | https://doi.org/10.1145/3290370 |
Language | English |
Book title | Proceedings of the ACM on Programming Languages, Volume 3 Issue POPL |
https://repository.mdx.ac.uk/item/88y51
Download files
22
total views4
total downloads1
views this month0
downloads this month