A practical method for on-the-fly data race detection
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1262878
- Scaling model checking of dataraces using dynamic information
- Space-efficient first race detection in shared memory programs with nested parallelism
- Efficient data race detection for async-finish parallelism
- Fast and Accurate Static Data-Race Detection for Concurrent Programs
Cited in
(15)- Bounding the number of segment histories during data race detection
- Non-intrusive detection of synchronization errors using execution replay
- Efficient data race detection for async-finish parallelism
- TRaDe: data race detection for Java
- scientific article; zbMATH DE number 6712238 (Why is no real title available?)
- Space-efficient first race detection in shared memory programs with nested parallelism
- scientific article; zbMATH DE number 1262851 (Why is no real title available?)
- scientific article; zbMATH DE number 1262878 (Why is no real title available?)
- A comparison of scalable labeling schemes for detecting races in OpenMP programs
- Race detection and reachability in nearly series-parallel DAGs
- Detecting data races in sequential programs with DIOTA
- Fast and Accurate Static Data-Race Detection for Concurrent Programs
- Dynamic Data-Race Detection Through the Fine-Grained Lens
- Data race avoidance and replay scheme for developing and debugging parallel programs on distributed shared memory systems
- Efficient access history for race detection
This page was built for publication: A practical method for on-the-fly data race detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046404)