Program slicing is a technique to extract program parts with respect to some special
computation. Since Weiser first proposed the notion of slicing in 1979, hundreds of papers …

During the past twenty-one years, over seventy-five papers and nine Ph. D. theses have
been published on pointer analysis. Given the tomes of work on this topic one may …

Virtual functions make code easier for programmers to reuse but also make it harder for
compilers to analyze. We investigate the ability of three static analysis algorithms to improve …

This paper proposes an efficient technique for context-sensitive pointer analysis that is
applicable to real C programs. For efficiency, we summarize the effects of procedures using …

We present a novel approach to dynamic datarace detection for multithreaded object-
oriented programs. Past techniques for on-the-fly datarace detection either sacrificed …

This paper presents a simple and efficient data flow algorithm for escape analysis of objects
in Java programs to determine (i) if an object can be allocated on the stack;(ii) if an object is …

This paper addresses the problem of resolving virtual method and interface calls in Java
bytecode. The main focus is on a new practical technique that can be used to analyze large …

Small changes can have major and nonlocal effects in object-oriented languages, due to the
use of subty** and dynamic dispatch. This complicates life for maintenance programmers …

We present practical approximation methods for computing and representing
interprocedural aliases for a program written in a language that includes pointers, reference …

In order to analyze a program that involves pointers, it is necessary to have (safe)
information about what each pointer points to. There are many different approaches to …