AtomSanitizer delivers an O(nk²) streaming checker for conflict serializability that is asymptotically faster, lower-memory, and the first shown to run with minimal locking inside a concurrent runtime monitor.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
k-sliced reorderings form a strictly increasing hierarchy converging to reads-from equivalence, supporting constant-space streaming algorithms for predictive monitoring against any regular specification at any fixed k.
The paper establishes treewidth bounds and MSO-axiomatizability results for weak memory models, introduces reads-from robustness, and derives algorithmic implications for verification.
citing papers explorer
-
Fast Atomicity Monitoring
AtomSanitizer delivers an O(nk²) streaming checker for conflict serializability that is asymptotically faster, lower-memory, and the first shown to run with minimal locking inside a concurrent runtime monitor.
-
Parametrizing Reads-From Equivalence for Predictive Monitoring
k-sliced reorderings form a strictly increasing hierarchy converging to reads-from equivalence, supporting constant-space streaming algorithms for predictive monitoring against any regular specification at any fixed k.
-
An MSO Framework for Weak-Memory Verification and Robustness
The paper establishes treewidth bounds and MSO-axiomatizability results for weak memory models, introduces reads-from robustness, and derives algorithmic implications for verification.