1 paper
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…