On Models for Sound Dynamic Data Race Detection: A Survey and An Outlook

Ensuring correctness in multi-threaded programs requires effective detection of concurrency bugs, which is challenging due to the nondeterminism of thread scheduling. Recently, there have been advancements in dynamic detectors based on various consistency models, assumptions, and algorithms. These detectors significantly improve concurrency coverage. However, due to limitations in the model assumptions, they are confined to the space obtained by reordering observed traces ( S ob ). It is important to investigate how different model assumptions impact detection results. Additionally, since each detector is evaluated on different sets of benchmark programs, it is unclear which detectors and algorithms are more effective and efficient. In this paper, we provide a systematic analysis of the reordering of observed traces by establishing a unified framework of four trace-restricted consistency models, whose detection spaces are strictly confined to S ob . We evaluate 14 recently published dynamic data race detectors and one classic happens-before-based detector against these models and answer seven research questions through theoretical analysis and experimental evaluation. This offers a new perspective for understanding and improving existing methodologies. Finally, we conceptualize a new model that extends beyond S ob by incorporating program semantics, serving as a direction for future research to bridge the gap between observed traces and the full program execution space.

Authors

Institutions

Publication Details

Journal
ACM Computing Surveys
Published
2026-11-17
DOI
https://doi.org/10.1145/3863936
Primary Topic
Software Testing and Debugging Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

On Models for Sound Dynamic Data Race Detection: A Survey and An Outlook

Jens Palsberg, Yan Cai, Siqi Liu, Shihao Zhu et al.
1 links
ACM Computing Surveys
Software Testing and Debugging Techniques
article

On Models for Sound Dynamic Data Race Detection: A Survey and An Outlook

Jens Palsberg, Yan Cai, Siqi Liu, Shihao Zhu, Jian Zhang, Yuqi Guo, Jinqiu Wang
article en

Abstract

Ensuring correctness in multi-threaded programs requires effective detection of concurrency bugs, which is challenging due to the nondeterminism of thread scheduling. Recently, there have been advancements in dynamic detectors based on various consistency models, assumptions, and algorithms. These detectors significantly improve concurrency coverage. However, due to limitations in the model assumptions, they are confined to the space obtained by reordering observed traces ( S ob ). It is important to investigate how different model assumptions impact detection results. Additionally, since each detector is evaluated on different sets of benchmark programs, it is unclear which detectors and algorithms are more effective and efficient. In this paper, we provide a systematic analysis of the reordering of observed traces by establishing a unified framework of four trace-restricted consistency models, whose detection spaces are strictly confined to S ob . We evaluate 14 recently published dynamic data race detectors and one classic happens-before-based detector against these models and answer seven research questions through theoretical analysis and experimental evaluation. This offers a new perspective for understanding and improving existing methodologies. Finally, we conceptualize a new model that extends beyond S ob by incorporating program semantics, serving as a direction for future research to bridge the gap between observed traces and the full program execution space.

ACM Computing Surveys
University of California, Los Angeles (US), Chinese Academy of Sciences (CN), Institute of Software (CN), University of Chinese Academy of Sciences (CN)
National Natural Science Foundation of China, Chinese Academy of Sciences, Institute of Software, Chinese Academy of Sciences
Software Testing and Debugging Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon