Output details

Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas

<10> This paper came out of an EPSRC project in which Danicic was the principal investigator. One algorithm is considered 'better than' another if it constructs a smaller slice. This paper gives the first proof that Weiser's algorithm (on which most slicing algorithms are based) gives predicate-minimal slices for classes of programs satisfying the given conditions. That is to say for this class of programs, and at this level of abstraction, Weiser's Algorithm is the best possible.