Sciweavers

27 search results - page 1 / 6
» Deriving a Slicing Algorithm via FermaT Transformations
Sort
View
TSE
2011
107views more  TSE 2011»
12 years 11 months ago
Deriving a Slicing Algorithm via FermaT Transformations
In this paper we present a case study in deriving an algorithm from a formal specification via FermaT transformations. The general method (which is presented in a separate paper)...
Martin P. Ward, Hussein Zedan
SCAM
2003
IEEE
13 years 9 months ago
Slicing the SCAM Mug: A Case Study in Semantic Slicing
In this paper we describe an improved formalisation of slicing in WSL transformation theory and apply the result to a particularly challenging slicing problem: the SCAM mug [1]. W...
Martin P. Ward
WCFLP
2005
ACM
13 years 10 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
PLDI
2004
ACM
13 years 10 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta