Showing cs.PLShow all
2 papers · 1 filter
cs.PL2023
How Hard is Weak-Memory Testing?
Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur +1
Weak-memory models are standard formal specifications of concurrency across hardware, programming languages, and distributed systems. A fundamental computational problem is consist…
cs.PL2023
On-The-Fly Static Analysis via Dynamic Bidirected Dyck Reachability
Shankaranarayanan Krishna, Aniket Lal, Andreas Pavlogiannis +1
Dyck reachability is a principled, graph-based formulation of a plethora of static analyses. Bidirected graphs are used for capturing dataflow through mutable heap data, and are us…