55 citations · 128 across the 19 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
Taming x86-TSO Persistency (Extended Version)
Artem Khyzha, Ori Lahav
We study the formal semantics of non-volatile memory in the x86-TSO architecture. We show that while the explicit persist operations in the recent model of Raad et al. from POPL'20…