Existing precise context-sensitive heap analyses do not scale well for large OO programs.
Further, identifying the right context abstraction becomes quite intriguing as two of the most …

Data-flow analyses like points-to analysis can vastly improve the precision of other analyses,
and enable powerful code optimizations. However, whole-program points-to analysis of …

The runtimes of managed object-oriented languages such as Java allocate objects on the
heap, and rely on automatic garbage collection (GC) techniques for freeing up unused …

In spite of decades of static-analysis research behind developing precise whole-program
analyses, languages that use just-in-time (JIT) compilers suffer from the imprecision of …

Static Program Analysis (SPA) has long been established as an important technique for
gaining insights into software systems. Over the last years, analysis designers increasingly …

In spite of decades of static-analysis research behind developing precise whole-program
dataflow analyses, languages that use just-in-time (JIT) compilers suffer from the imprecision …

Despite being a very old discipline, pointer analysis still attracts several research papers
every year in premier programming language venues. While a major goal of contemporary …

With the advent of multi-core systems, GPUs and FPGAs, loop parallelization has become a
promising way to speed-up program execution. In order to stay up with time, various …

Orthogonal persistence implemented with non-volatile memory (NVM) allows the
programmers to easily create persistent containers, which are container data-structures …

Partial analysis is a program analysis technique used in compilation systems when the
whole program is not available. Many recent promising approaches perform partial analysis …