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 …

With the increasing popularity of blockchain, automatically detecting vulnerabilities in smart
contracts is becoming a significant problem. Prior research mainly identifies smart contract …

Static analysis is used to automatically detect bugs and security breaches, and aids compiler
optimization. Whole-program analysis (WPA) can yield high precision, however causes long …

The extensive use of libraries in modern software impedes the scalability of pointer analysis.
To address this issue, library summarization can be beneficial, but only if the resulting …

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 …

Despite the benefits of using third-party libraries (TPLs), the misuse of TPL functions raises
quality and security concerns. Using traditional static analysis to detect bugs caused by TPL …

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

Consider any two vertices in a weighted digraph. The exact path length problem is to
determine if there is a path of a given fixed cost between these vertices. This paper focuses …

Static program analysis uses sensitivity to balance between precision and scalability.
However, finer sensitivity does not necessarily lead to more precise results but may reduce …