Slicing algorithms are minimal for programs which can be expressed as linear, free, liberal schemas

Danicic, Sebastian and Fox, Chris and Harman, Mark and Hierons, Robert Mark and Howroyd, John and Laurence, Mike (2005) Slicing algorithms are minimal for programs which can be expressed as linear, free, liberal schemas. The computer Journal, 48 (6). pp. 737-748.

Full text not available from this repository.

Item Type:	Article
Subjects:	UNSPECIFIED
ID Code:	334
Deposited By:	Prof Mark Harman
Deposited On:	06 Nov 2007 16:14
Last Modified:	06 Nov 2007 16:14

Repository Staff Only: item control page

Accessibility | Terms and Conditions | Last Modified 01 November 2007