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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.PL 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
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.
citing papers explorer
-
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.