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.
Adve and Kourosh Gharachorloo
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.PL 2verdicts
UNVERDICTED 2representative citing papers
Introduces the TRW partial order for sound deadlock prediction and a weakened variant for completeness, both efficiently computable and agreeing on benchmarks.
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.
-
Partial Orders for Precise and Efficient Dynamic Deadlock Prediction
Introduces the TRW partial order for sound deadlock prediction and a weakened variant for completeness, both efficiently computable and agreeing on benchmarks.