Pith. sign in

It follows that|TH/VHB| = O |T max H /VHB|· poly(n) , and thus it suffices to argue that VC-DPOR runs in time O(|TH/VHB|· poly(n))

Since we have constantly many threads, it follows that given a maximal tracet, there exist O(poly(n)) different sets X⊆E( t) for which there exists a tracet′ such that (i)E(t′) = X, (ii)t is a maximal extension oft′ · 2018

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.PL 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Value-centric Dynamic Partial Order Reduction

cs.PL · 2019-09-03 · conditional · novelty 8.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Value-centric Dynamic Partial Order Reduction cs.PL · 2019-09-03 · conditional · none · ref 2

    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.