3 citations · 5 across the 3 of their papers we have counts for
4 papers
Effect Summaries for Thread-Modular Analysis
Lukáš Holík, Roland Meyer, Tomáš Vojnar +1
We propose a novel guess-and-check principle to increase the efficiency of thread-modular verification of lock-free data structures. We build on a heuristic that guesses candidates…
Locality and Singularity for Store-Atomic Memory Models
Egor Derevenetc, Roland Meyer, Sebastian Schweizer
Robustness is a correctness notion for concurrent programs running under relaxed consistency models. The task is to check that the relaxed behavior coincides (up to traces) with se…
Munchausen Iteration
Roland Meyer, Sebastian Muskalla
We present a method for solving polynomial equations over idempotent omega-continuous semirings. The idea is to iterate over the semiring of functions rather than the semiring of i…
Checking Robustness against TSO
Ahmed Bouajjani, Egor Derevenetc, Roland Meyer
We present algorithms for checking and enforcing robustness of concurrent programs against the Total Store Ordering (TSO) memory model. A program is robust if all its TSO computati…