RELAY: static race detection on millions of lines of code. Data races occur when multiple threads are about to access the same piece of memory, and at least one of those accesses is a write. Such races can lead to hard-to-reproduce bugs that are time consuming to debug and fix. We present RELAY, a static and scalable race detection analysis in which unsoundness is modularized to a few sources. We describe the analysis and results from our experiments using RELAY to find data races in the Linux kernel, which includes about 4.5 million lines of code.
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
- Apinis, Kalmer; Vene, Varmo; Vojdani, Vesal: Demand-driven interprocedural analysis for map-based abstract domains (2018)
- Lidbury, Christopher; Donaldson, Alastair F.: Dynamic race detection for C++11 (2017)
- Mukherjee, Suvam; Kumar, Arun; D’Souza, Deepak: Detecting all high-level dataraces in an RTOS kernel (2017)
- Vojdani, Vesal: Static data race analysis of heap-manipulating C programs (2010)
- Wang, Chao; Yang, Yu; Gupta, Aarti; Gopalakrishnan, Ganesh: Dynamic model checking with property driven pruning to detect race conditions (2008)