CV-rules equivalently characterize serializability via explicit orders satisfying C-rule and V-rule, used to verify five protocols including SSN and Aria with Lean mechanization of most results.
On the Complexity of Checking Transactional Consistency
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
Verifying sequential consistency with at most π preemptions is polynomial-time for single-writer programs, NP-hard for two-writer programs, and has an ETH-based conditional lower bound for three-writer programs.
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.
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
-
CV-Rules: Serializability Verification of Concurrency Control Protocols via Explicit Transaction Ordering
CV-rules equivalently characterize serializability via explicit orders satisfying C-rule and V-rule, used to verify five protocols including SSN and Aria with Lean mechanization of most results.
-
Verifying Sequential Consistency under Bounded Preemptions
Verifying sequential consistency with at most π preemptions is polynomial-time for single-writer programs, NP-hard for two-writer programs, and has an ETH-based conditional lower bound for three-writer programs.
-
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.
-
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.