55 citations · 78 across the 8 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
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★ 19 cited
Repairing and Mechanising the JavaScript Relaxed Memory Model
Conrad Watt, Christopher Pulte, Anton Podkopaev +5
Modern JavaScript includes the SharedArrayBuffer feature, which provides access to true shared memory concurrency. SharedArrayBuffers are simple linear buffers of bytes, and the Ja…