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 slicing is a technique for reducing the amount of information that needs to be
absorbed by a programmer. Given a point of “interest” in a program, described by a variable …

A program slice consists of the parts of a program that (potentially) affect the values
computed at some point of interest. Such a point of interest is referred to as a slicing …

The notion of a program slice, originally introduced by Mark Weiser, is useful in program
debugging, automatic parallelization, and program integration. A slice of a program is taken …

We describe a translation validation infrastructure for the GNU C compiler. During the
compilation the infrastructure compares the intermediate form of the program before and …

A formal, general model of program dependences is presented and used to evaluate several
dependence-based software testing, debugging, and maintenance techniques. Two …

The need to integrate several versions of a program into a common one arises frequently,
but it is a tedious and time consuming task to integrate programs by hand. To date, the only …

This paper describes a language-independent program representation-the program
dependence graph—and &mCusses how program dependence graphs, together with …

Abstract Information flow control (IFC) checks whether a program can leak secret data to
public ports, or whether critical computations can be influenced from outside. But many IFC …

Program dependence graphs have been proposed for use in optimizing, vectorizing, and
parallelizing compilers, and for program integration. This paper proposes their use as the …