Sciweavers

7 search results - page 1 / 2
» Program Slicing 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
WCRE
2000
IEEE
13 years 8 months ago
Reverse Engineering from Assembler to Formal Specifications via Program Transformations
The FermaT transformation system, based on research carried out over the last sixteen years at Durham University, De Montfort University and Software Migrations Ltd., is an indust...
Martin P. Ward
SCP
2010
108views more  SCP 2010»
13 years 3 months ago
Combining dynamic and static slicing for analysing assembler
One of the most challenging tasks a programmer can face is attempting to analyse and understand a legacy assembler system. Many features of assembler make analysis difficult, and ...
Martin P. Ward, Hussein Zedan
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