_id,doi,title
13179,10.1145/3591230,CQS: A formally-verified framework for fair and abortable synchronization
10153,10.1145/3485504,Transitioning from structural to nominal code with efficient gradual typing
10191,10.1145/3485541,The reads-from equivalence for the TSO and PSO memory models
8324,10.1145/3371093,Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time
10190,10.1145/3360550,Value-centric dynamic partial order reduction
10416,10.1145/3158118,Optimal Dyck reachability for data-dependence and Alias analysis
10417,10.1145/3158119,Data-centric dynamic partial order reduction
10418,10.1145/3158121,A new proof rule for almost-sure termination