The quality and the correctness of software are often the greatest concern in electronic
systems. Formal verification tools can provide a guarantee that a design is free of specific …

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 …

In optimizing compilers, data structure choices directly influence the power and efficiency of
practical program optimization. A poor choice of data structure can inhibit optimization or …

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

During the past few years, several of us have been asked many times about references on
finite tree automata. On one hand, this is the witness of the liveness of this field. On the other …

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

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 …

We survey basic garbage collection algorithms, and variations such as incremental and
generational collection. The basic algorithms include reference counting, mark-sweep, mark …

This paper presents two sets of observations relating static and dynamic analysis. The first
concerns synergies between static and dynamic analysis. Wherever one is utilized, the other …