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 …

Program analysis concerns static techniques for computing reliable approximate information
about the dynamic behaviour of programs. Applications include compilers (for code …

One of the primary challenges in intrusion detection is modelling typical application behavior
so that we can recognize attacks by their atypical effects without raising too many false …

Engineering a Compiler, Third Edition covers the latest developments in compiler
technology, with new chapters focusing on semantic elaboration (the problems that arise in …

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 …

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 …

Most points-to analysis research has been done on different systems by different groups,
making it difficult to compare results, and to understand interactions between individual …

This paper describes how a number of program-analysis problems can be solved by
transforming them to graph-reachability problems. Some of the program-analysis problems …

The goal of points-to analysis for Java is to determine the set of objects pointed to by a
reference variable or a reference object field. We present object sensitivity, a new form of …

This paper presents a combined pointer and escape analysis algorithm for Java programs.
The algorithm is based on the abstraction of points-to escape graphs, which characterize …