Stateful partial-order reduction with blocking cannot be approximated within polynomial factors unless P=NP, and a new 'includes first set' heuristic outperforms persistent sets in experiments.
A Pragmatic Approach to Stateful Partial Order Reduction
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Revisiting Stateful Partial-Order Reduction
Stateful partial-order reduction with blocking cannot be approximated within polynomial factors unless P=NP, and a new 'includes first set' heuristic outperforms persistent sets in experiments.