A Lazy Semantics for Program Slicing

Danicic, Sebastian; Harman, Mark; Howroyd, John and Ouarbya, Lahcen. 2004. 'A Lazy Semantics for Program Slicing'. In: 1st International Workshop on Programming Language Interference and Dependence. Verona, Italy 25 August 2004. [Conference or Workshop Item]

verona.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial.

Download (136kB) | Preview

Abstract or Description

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.

Item Type:

Conference or Workshop Item (Paper)

Departments, Centres and Research Units:



25 August 2004Published

Event Location:

Verona, Italy

Date range:

25 August 2004

Item ID:


Date Deposited:

02 Dec 2015 16:03

Last Modified:

12 Jan 2022 18:06



View statistics for this item...

Edit Record Edit Record (login required)