7 citations · 12 across the 4 of their papers we have counts for
5 papers · 1 filter
Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis
Roland Meyer, Sebastian Wolff
Verification of concurrent data structures is one of the most challenging tasks in software verification. The topic has received considerable attention over the course of the last…
Fast Witness Counting
Peter Chini, Rehab Massoud, Roland Meyer +1
We study the witness-counting problem: given a set of vectors in the -dimensional vector space over , a target vector , and an integer , count all ways t…
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems
Matthew Hague, Roland Meyer, Sebastian Muskalla +1
We give a direct polynomial-time reduction from parity games played over the configuration graphs of collapsible pushdown systems to safety games played over the same class of grap…
Bounded Context Switching for Valence Systems
Roland Meyer, Sebastian Muskalla, Georg Zetzsche
We study valence systems, finite-control programs over infinite-state memories modeled in terms of graph monoids. Our contribution is a notion of bounded context switching (BCS). V…
Fine-Grained Complexity of Safety Verification
Peter Chini, Roland Meyer, Prakash Saivasan
We study the fine-grained complexity of Leader Contributor Reachability (LCR) and Bounded-Stage Reachability (BSR), two variants of the safety verification problem for shared memor…