Understanding program behaviors is important to verify program properties or to optimize
programs. Static analysis is a widely used technique to approximate program behaviors via …

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 …

Over the past decades, context sensitivity has been considered as one of the most effective
ideas for improving the precision of pointer analysis for Java. Different from the extremely …

Context-free language reachability (CFL-reachability) is a fundamental framework for
program analysis. A large variety of static analyses can be formulated as CFL-reachability …

Given an edge-labeled graph, context-free language reachability (CFL-reachability)
computes reachable node pairs by deriving new edges and adding them to the graph. The …

Context-free language (CFL) reachability is a fundamental framework for formulating
program analyses. CFL-reachability analysis works on top of an edge-labeled graph by …

A pushdown vector addition system with states (PVASS) extends the model of vector
addition systems with a pushdown store. A PVASS is said to be\emph {bidirected} if every …

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 …

Many context-sensitive dataflow analyses can be formulated as an extended Dyck-CFL
reachability problem, where function calls and returns are modeled as partially matched …

Datalog is a powerful yet elegant language that allows expressing recursive computation.
Although Datalog evaluation has been extensively studied in the literature, so far, only loose …