Natural reductions for concurrent programs admit a sound-and-complete polynomial-time soundness check without synchronization but are coNP-hard under locking.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Complexity of Checking Soundness of Natural Reductions (Extended Version)
Natural reductions for concurrent programs admit a sound-and-complete polynomial-time soundness check without synchronization but are coNP-hard under locking.