3 papers
cs.CC2025
Probability Spaces for Random Algorithms
Lasha Epremidze, George Nadareishvili, Jonas Oberhauser +1
Standard analyses of expected runtimes for randomized algorithms typically bypass the explicit construction of an underlying probability space. In this paper, we provide a formal,…
cs.LO2021
VSync: Push-Button Verification and Optimization for Synchronization Primitives on Weak Memory Models (Technical Report)
Jonas Oberhauser, Rafael Lourenco de Lima Chehab, Diogo Behrens +8
This technical report contains material accompanying our work with same title published at ASPLOS'21. We start in Sec. 1 with a detailed presentation of the core innovation of this…
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…