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 …

Abstract MARK HARMAN and ROBERT HIERONS review three semantic paradigms for
slicing—static, dynamic and conditioned; and two syntactic paradigms—syntax‐preserving …

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 …

Notions of program dependency arise in many settings: security, partial evaluation, program
slicing, and call-tracking. We argue that there is a central notion of dependency common to …

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

Programmers spend considerable time debugging code. Symbolic debuggers provide some
help but the task remains complex and difficult. Other than breakpoints and tracing, these …

The Program Dependence Web (PDW) is a program representation that can be directly
interpreted using control-, data-, or demand-driven models of execution. A PDW combines a …

Modern optimizing compilers use several passes over a program's intermediate
representation to generate good code. Many of these optimizations exhibit a phase-ordering …

Program slicing is a source-to-source transformation that has applications in construction,
analysis, testing and debugging of programs. A program slice contains the portion of a …

We believe that optimizing compilers should treat the machine-independent
optimizations(eg, conditional constant propagation, global value numbering) and code …