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 …

Software fault localization, the act of identifying the locations of faults in a program, is widely
recognized to be one of the most tedious, time consuming, and expensive-yet equally critical …

Understanding the implementation of a certain feature of a system requires identification of
the computational units of the system that contribute to this feature. In many cases, the …

Impact analysis, determining when a change in one part of a program affects other parts of
the program, is time-consuming and problematic. Impact analysis is rarely used to predict …

This chapter describes traditional and intuitive fault localization techniques, including
program logging, assertions, breakpoints, and profiling. Many advanced fault localization …

Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention
of the user on a relevant subset of program statements. In this paper we present the design …

Software debugging is the process of locating and correcting faulty code. Prior techniques to
locate faulty code either use program analysis techniques such as backward dynamic …

Dynamic slicing algorithms have been considered to aid in debugging for many years.
However, as far as we know, no detailed studies on evaluating the benefits of using dynamic …

Current slicing techniques cannot handle systems written in multiple programming
languages. Observation-Based Slicing (ORBS) is a language-independent slicing technique …

Although dynamic program slicing was first introduced to aid in user level debugging,
applications aimed at improving software quality, reliability, security, and performance have …