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
fields
cs.PL 2representative citing papers
A Monte Carlo estimator converts stateless optimal DPOR into an unbiased poly-time estimator for the number of Mazurkiewicz traces by sampling paths in the exploration tree and using stochastic enumeration to control variance.
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.
-
State Space Estimation for DPOR-based Model Checkers(Extended Version)
A Monte Carlo estimator converts stateless optimal DPOR into an unbiased poly-time estimator for the number of Mazurkiewicz traces by sampling paths in the exploration tree and using stochastic enumeration to control variance.