The paper defines the value-happens-before trace equivalence, proves it is coarser than happens-before (exponentially so in some programs), and presents the VC-DPOR algorithm that explores its classes in polynomial time per class for a bounded number of threads.
In VC-DPOR Algorithm 5, given an extensionQ, we first call ExtendRoot, and then for each leaf thread we call its corresponding ExtendLeaf
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Value-centric Dynamic Partial Order Reduction
The paper defines the value-happens-before trace equivalence, proves it is coarser than happens-before (exponentially so in some programs), and presents the VC-DPOR algorithm that explores its classes in polynomial time per class for a bounded number of threads.