Showing cs.PLShow all
2 papers · 1 filter
cs.PL2026
On the Decidability of Verification under Release/Acquire
Giovanna Kobus Conrado, Andreas Pavlogiannis
The verification of concurrent programs under weak-memory models is a burgeoning effort, owing to the increasing adoption of weak memory in concurrent software and hardware. Releas…
cs.PL2024
Program Analysis via Multiple Context Free Language Reachability
Giovanna Kobus Conrado, Adam Husted Kjelstrøm, Andreas Pavlogiannis +1
Context-free language (CFL) reachability is a standard approach in static analyses, where the analysis question is phrased as a language reachability problem on a graph wrt a C…