Dyck reachability is the standard formulation of a large domain of static analyses, as it
achieves the sweet spot between precision and efficiency, and has thus been studied …

Many problems in static program analysis can be modeled as the context-free language
(CFL) reachability problem on directed labeled graphs. The CFL reachability problem can …

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 usual …

Context-free language (CFL) reachability is a standard approach in static analyses, where
the analysis question (eg, is there a dataflow from x to y?) is phrased as a language …

CFL/Dyck reachability is a simple graph-theoretic problem: given a CFL/Dyck language L
over an alphabet Σ, a graph G=(V, E) of Σ-labeled edges, and two distinguished nodes s, t∈ …

In this paper we study the fine-grained complexity of the CFL reachability problem. We first
present one of the existing algorithms for the problem and an overview of conditional lower …

SMORE (Chen et al., 2023) recently proposed the concept of semantic regular expressions
that extend the classical formalism with a primitive to query external oracles such as …

Tools to automatic program verification have been a central research topic over the last
decades. Often disparaged as slow in the past, the steady enhancement of tools paid off in …

In this thesis we study the fine-grained complexity of the CFL reachability problem. We first
present one of the existing algorithms for the problem and an overview of conditional lower …