A lazy semantics for program slicing
Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya · Goldsmiths Research Online · 2004
This paper demonstrates that if a slicing algorithm is expressed denotationally, without intermediate structures, then the power of denotational semantics can be used to prove correctness. The semantics preserved by slicing algorithms, however, is non-standard. We introduce a new lazy semantics which we prove is preserved by slicing algorithms. It is demonstrated how other concepts in program dependence, difficult or impossible to express using standard semantics, for example variable dependence, can be expressed naturally using our new lazy semantics.