A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The
input is a graph where the edges are labeled with different types of opening and closing …

Smart contracts are programs that are stored and executed on the Blockchain and can
receive, manage and transfer money (cryptocurrency units). Two important problems …

There is a huge and growing gap between the speed of accesses to data stored in main
memory vs cache. Thus, cache misses account for a significant portion of runtime overhead …

We consider interprocedural data-flow analysis as formalized by the standard IFDS
framework, which can express many widely-used static analyses such as reaching …

There is a huge gap between the speeds of modern caches and main memories, and
therefore cache misses account for a considerable loss of efficiency in programs. The …

We study algorithmic questions for concurrent systems where the transitions are labeled
from a complete, closed semiring, and path properties are algebraic with semiring …

The notion of treewidth of graphs has been exploited for faster algorithms for several
problems arising in verification and program analysis. Moreover, various notions of …

We study algorithmic questions wrt algebraic path properties in concurrent systems, where
the transitions of the system are labeled from a complete, closed semiring. The algebraic …

The ability to provide succinct information about why a property does, or does not, hold in a
given system is a key feature in the context of formal verification and model checking. It can …

Data-flow analysis is a general technique used to compute information of interest at different
points of a program and is considered to be a cornerstone of static analysis. In this thesis, we …