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 …

\begin {abstract} Multithreaded programs are notoriously prone to race conditions. Prior work
on dynamic race detectors includes fast but imprecise race detectors that report false alarms …

Verification by state-space exploration, also often referred to as" model checking", is an
effective method for analyzing the correctness of concurrent reactive systems (eg …

In shared-memory parallel programs that use explicit synchronization, race conditions result
when accesses to shared memory are not properly synchronized. Race conditions are often …

We present a novel technique for static race detection in Java programs, comprised of a
series of stages that employ a combination of static analyses to successively reduce the …

Software maintenance is the process of designing and integrating consistent changes to an
existing software system. Doing effective maintenance is a complex task due in part to the …

This paper describes algorithms for inserting monitoring code to profile and trace programs.
These algorithms greatly reduce the cost of measuring programs with respect to the …

Bugs in multi-threaded programs often arise due to data races. Numerous static and
dynamic program analysis techniques have been proposed to detect data races. We …