Skip to content
Book Open access

Precise and Efficient Static Data Race Detection

Oct 2026 · Proceedings of the 41st IEEE/ACM International Conference on Automated Software Engineering · 0 citations · 83 references

TL;DR

This paper presents a precise modeling of data races based on event-level ordering constraints, which avoids any instrumentation while capturing the exact semantics and covering all potential race occurrences within the given bounded scope and integrates it into a concurrent program verification framework and proves its correctness.

Abstract

Data races pose a serious threat to the correctness of concurrent programs. Traditional model-checking-based race detection techniques typically encode race detection as assertion verification, but this introduces substantial overhead due to numerous auxiliary variables and statements. In this paper, we present a precise modeling of data races based on event-level ordering constraints, which avoids any instrumentation while capturing the exact semantics and covering all potential race occurrences within the given bounded scope. We integrate it into a concurrent program verification framework and prove its correctness. Moreover, we enhance the existing theory solvers for ordering consistency theory with two new components, enabling effective reasoning about data races. Finally, we introduce an encoding optimization that leverages the novel concept of value-critical events to eliminate redundant value constraints. We implement our approach in a prototype tool, Deagle-DR, and compare it against state-of-the-art tools, including Dartagnan, Ugemcutter, Cseq-DR, LaDR, and Iekke. Experiments show that our approach is competitive with state-of-the-art methods.

Read PDF

Similar papers

Book Open access Oct 2026

Iekkë: A Bounded-Round Partial-Order Encoding Verification Tool for Concurrent C Programs

We present Iekkë, a BMC tool for verifying multi-threaded C programs. It implements a new bounded-round partial-order encoding for the sequential consistency shared-memory model. The encoding combines the compactness of lazy sequentialization with the structural precision of the partial-order approach. Its concurrency...

P. Di Biase, Bernd Fischer, Salvatore La Torre et al. · 0 citations
Preprint Oct 2026

Breaking the Coupling: Efficient Concurrency Fuzzing for Linux Kernel Data Race Detection

A new concurrency fuzzing paradigm that decouples concurrent-input generation from thread-interleaving exploration, enabling expensive scheduling to focus on promising inputs and demonstrating the effectiveness of decoupling concurrent-input generation from interleaving exploration and concentrating scheduling effort o...

Cen Zhang, Jia-Ju Bai, Zi-Yu Zhang et al. · 0 citations
Book Open access Oct 2026

SafeDep: Detecting State Mutation Unsoundness in Rust via Dependency Slicing and LLM Reasoning

Rust's type system protects safe code, but many low-level abstractions depend on internal unsafe operations whose correctness rests on memory and logical invariants. In struct-based abstractions, a sibling method may legally modify internal fields while invalidating a precondition required by another method's unsafe op...

Zi-Hao Rao, Yi-Lin Chen, Cheng-Jun Chen et al. · 0 citations
Sep 2026

Efficient Branch-and-Bound Testing and Verification of zkVMs

ZEBRA is a fully automated verification and bug-detection framework that reduces zkVM verification to a solution-set cardinality problem over a canonical trace space, where redundancies such as null-row padding and non-deterministic permutations are eliminated prior to counting.

Hideaki Takahashi, Suman Jana, Junfeng Yang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.