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 …

Missing a security operation such as a bound check has been a major cause of security-
critical bugs. Automatically checking whether the code misses a security operation in large …

Pointer analysis is one of the fundamental problems in static program analysis. Given a set
of pointers, the task is to produce a useful over-approximation of the memory locations that …

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 …

A recent study showed that the applicability of context-free path querying (CFPQ) algorithms
with relational query semantics integrated with graph databases is limited because of low …

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

Alias analysis (AA) is a prerequisite for many compiler optimizations, which are crucial for
performance especially for parallel and scientific software. AA is the subject of ongoing …

Can a Python program be executed statement-by-statement by neural networks composed
according to the source code? We formulate the Neuro-Symbolic Execution Problem and …

Context-Free Path Querying In Terms of Linear Algebra Page 1 VLDB 2021 PhD Workshop
Context-Free Path Querying In Terms of Linear Algebra Rustam Azimov supervised by Semyon …