Speaker: Aharon Abadi, IBM Haifa Research Lab

Title: Plan-Based Approach to Program Slicing

We present a new approach to program slicing based on the plan
calculus.  The plan representation has previously been used in
commerically-successful program transformation projects.  Using plans
for slicing has a number of benefits.  The computed slices are at
least as accurate as (that is, no larger than) those computed by the
best current algorithms, and in certain cases even smaller.  The
algorithm handles unstructured programs, and produces fewer branches
than previous approaches.  The semantics of the plan calculus supports
a rigorous correctness proof for the slicing algorithms in a uniform
conceptual framework.

Join work with Ran Ettinger and Yishai A. Feldman