Harman, Mark; Simpson, D. J. and Danicic, Sebastian. 1996. Slicing programs in the presence of errors. Formal Aspects of Computing, 8(4), pp. 490-497. ISSN 0934-5043 [Article]

No full text available

Abstract or Description

Program slicing is a technique by which statements are deleted from a program in such a way as to preserve a projection of the original program's semantics. It is shown that slicing algorithms based upon traditional defined and referenced variable sets do not preserve a projection of strict semantics with respect to computations which cause errors. Rather, these approaches preserve a projection of the program's semantics which is lazy with respect to errors. A modified version of defined and referenced variable sets is introduced, which provides the freedom to choose the form of semantics to be preserved.

Item Type:	Article
Identification Number (DOI):	https://doi.org/10.1007/BF01213536
Departments, Centres and Research Units:	Computing
Dates:	Date Event 1996 Published
Item ID:	15222
Date Deposited:	02 Dec 2015 13:56
Last Modified:	13 Jun 2016 12:33
Peer Reviewed:	Yes, this version has been peer-reviewed.
URI:	https://research.gold.ac.uk/id/eprint/15222

Edit Record (login required)