3 papers
cs.LO2026
PVASS Reachability is Decidable
Roland Guttenberg, Eren Keskin, Roland Meyer
Reachability in pushdown vector addition systems with states (PVASS) is among the longest standing open problems in Theoretical Computer Science. We show that the problem is decida…
cs.FL2025
On the Separability Problem of VASS Reachability Languages
Eren Keskin, Roland Meyer
We show that the regular separability problem of VASS reachability languages is decidable and -complete. At the heart of our decision procedure are doubly-marked gra…
cs.PL2024
SNIP: Speculative Execution and Non-Interference Preservation for Compiler Transformations
Sören van der Wall, Roland Meyer
We address the problem of preserving non-interference across compiler transformations under speculative semantics. We develop a proof method that ensures the preservation uniformly…