Title: Slicing EFSMs
David Clark
joint work with K. Androutsopoulos, M. Harman, W. Lu and L. Tratt

Abstract

Starting from foundational  work by Korel, Singh, Tahat, and Vaysburg on slicing 
Extended Finite State Machines, we make improvements in their approach. First, 
using work on slicing Java by Ranganath, Amtoft, Banerjee, Hatcliff and Dwyer, 
we introduce new notions of control dependence that allow non-termination and 
multiple termination points, so that dependency can be calculated for any EFSM, 
rather than being restricted to those with a single termination point. Second, 
we introduce a new, less conservative  slicing algorithm for EFSMs. We show some 
properties of these algorithms.