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.
In: Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
Consistency testing for release-acquire C11 is in P with one writer per location but NP-hard with two writers and ETH-hard for subexponential time with three writers.