26 citations · 29 across the 5 of their papers we have counts for
Showing 2020 · cs.PLShow all
2 papers · 2 filters
cs.PL2020
Making Weak Memory Models Fair
Ori Lahav, Egor Namakonov, Jonas Oberhauser +2
Liveness properties, such as termination, of even the simplest shared-memory concurrent programs under sequential consistency typically require some fairness assumptions about the…
cs.PL2020
The Decidability of Verification under Promising 2.0
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole +2
In PLDI'20, Lee et al. introduced the \emph{promising } semantics PS 2.0 of the C++ concurrency that captures most of the common program transformations while satisfying the DRF gu…