Skip to content
Preprint

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

Oct 2026 · 0 citations · 58 references
Computer Science

TL;DR

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 on promising candidates.

Abstract

Detecting data races in the Linux kernel requires exploring both the input space and the thread-interleaving space. Existing kernel concurrency fuzzers couple these two searches by exploring interleavings during fuzzing, often spending substantial scheduling effort on inputs with little potential to trigger real races. In this paper, we present a new concurrency fuzzing paradigm that decouples concurrent-input generation from thread-interleaving exploration, enabling expensive scheduling to focus on promising inputs. To identify inputs that warrant targeted scheduling, we introduce May Race Pairs (MRPs), which represent conflicting memory-access pairs observed within a dynamically determined time threshold. Our framework first generates and executes concurrent syscall groups without controlled scheduling, collecting MRPs to guide further input mutation and identify schedule-worthy inputs. It then uses a separate scheduling instance to explore targeted interleavings and confirm real data races. To improve the effectiveness of both stages, we incorporate LLM-assisted semantic mutation for generating diverse syscall groups, backpressure-guided dynamic threshold control for balancing candidate production and scheduling consumption, and history-aware context recovery, context-aware interleaving scheduling, and candidate MRP prioritization for efficient race confirmation. We implement our framework for the Linux kernel and evaluate it on eight common kernel modules in Linux 6.17. It discovers 187 unique real-world data races, including 59 harmful races. Under the same testing budget, our approach detects substantially more data races than existing kernel concurrency fuzzers, including SegFuzz and CONZZER. These results demonstrate the effectiveness of decoupling concurrent-input generation from interleaving exploration and concentrating scheduling effort on promising candidates.

View source

Similar papers

Preprint Oct 2026

XRust: Detecting Logical Races in Rust Linux Drivers

Rust is increasingly used in Linux to improve memory safety, but its guarantees do not prevent logical races: individually synchronized operations can still interleave in ways that violate higher-level invariants. Detecting such bugs typically requires manually written specifications and carefully controlled execution...

Qing-Xiao Xu, Ze Sheng, Zhi-Cheng Chen et al. · 0 citations
Book Open access Sep 2026

Tamias: Feedback-Guided Systematic Concurrency Exploration for Transparent Distributed System Fuzzing

Tamias is the first distributed system testing tool to integrate transparent, feedback-guided input exploration with systematic concurrency exploration and improves branch coverage over the state of the art and achieves feedback determinism for branch coverage on all evaluated target systems.

Cong-Yu Liu, Yao-Xu Song, Pedro Fonseca et al. · 0 citations
Preprint Oct 2026

REINS: Agent-guided Thread Scheduling for Concurrency Bug Detection and Reproduction

Concurrency bugs manifest only under specific thread interleavings, making them hard to detect and reproduce. Existing controlled concurrency testing techniques take over thread scheduling to explore the interleaving space. As the space grows rapidly with program scale, finding interleavings that can trigger bugs withi...

Yu Zhang, C. Păsăreanu, Guo-Wei Yang · 0 citations
Book Open access Oct 2026

Precise and Efficient Static Data Race Detection

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 it...

Pei-Feng Wang, Zhi-Hang Sun, Fei He · 0 citations
Open access Oct 2026

Efficient Predictive Monitoring of Message Passing Interface Programs

The Message Passing Interface (MPI) is the standard programming model for high-performance computing, yet nondeterministic scheduling in concurrent executions makes reliability assurance highly challenging. Beyond deadlocks, property-related bugs such as modifying a send buffer before a nonblocking send completes or ac...

Jia-Qiang Yao, Hao-Cheng Geng, Zhen-Bang Chen · 0 citations
Book Open access Oct 2026

Safe Multi-site Binary Instrumentation of Running x86-64 Programs

Applying binary instrumentation to a running x86-64 process is difficult because variable-length instructions and weak alignment guarantees prevent safe in-place code modification under concurrent execution. Existing run-time approaches either trap concurrent threads on every overwrite or require global synchronization...

Jihun Baek, Sanghoon Han, Hyungon Moon · 0 citations

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