Hybrid Static–Dynamic Analysis for Statically Bounded Region Serializability

Data races are common. They are difficult to detect, avoid, or eliminate, and programmers sometimes introduce them intentionally. However, shared-memory programs with data races have unexpected, erroneous behaviors. Intentional and unintentional data races lead to atomicity and sequential consistency (SC) violations, and they make it more difficult to understand, test, and verify software. Existing approaches for providing stronger guarantees for racy executions add high run-time overhead and/or rely on custom hardware. This paper shows how to provide stronger semantics for racy programs while providing relatively good performance on commodity systems. A novel hybrid static–dynamic anal-ysis called EnfoRSer provides end-to-end support for a memory model called statically bounded region serializ-ability (SBRS) that is not only stronger than weak memory models but is strictly stronger than SC. EnfoRSer uses static compiler analysis to transform regions, and dynamic anal-ysis to detect and resolve conflicts at run time. By demon-strating commodity support for a reasonably strong memory model with reasonable overheads, we show its potential as an always-on execution model