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 …

The automated and semi-automated analysis of source code has remained a topic of
intense research for more than thirty years. During this period, algorithms and techniques for …

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

Software engineers are faced with a dilemma. They want to write general and wellstructured
programs that are flexible and easy to maintain. On the other hand, generality has a price …

The paper shows how a large class of interprocedural dataflow-analysis problems can be
solved precisely in polynomial time by transforming them into a special kind of graph …

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

Shape analysis concerns the problem of determining" shape invariants" for programs that
perform destructive updating on dynamically allocated storage. This article presents a …

Static analysis of programs is indispensable to any software tool, environment, or system
that requires compile-time information about the semantics of programs. With the emergence …

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 describes how a number of program-analysis problems can be solved by
transforming them to graph-reachability problems. Some of the program-analysis problems …