Sciweavers

956 search results - page 4 / 192
» Slicing Objects Using System Dependence Graphs
Sort
View
SIGSOFT
1994
ACM
13 years 11 months ago
A New Model of Program Dependences for Reverse Engineering
A dependence model for reverse engineering should treat procedures in a modular fashion and should be fine-grained, distinguishing dependences that are due to different variables....
Daniel Jackson, Eugene J. Rollins
IJICT
2007
143views more  IJICT 2007»
13 years 7 months ago
A parallel algorithm for dynamic slicing of distributed Java programs in non-DSM systems
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...
Durga Prasad Mohapatra, Rajib Mall, Rajeev Kumar
SCAM
2003
IEEE
14 years 21 days ago
The Java System Dependence Graph
The Program Dependence Graph was introduced by Ottenstein and Ottenstein in 1984. It was suggested to be a suitable internal program representation for monolithic programs, for th...
Neil Walkinshaw, Marc Roper, Murray Wood
JUCS
2007
80views more  JUCS 2007»
13 years 7 months ago
Higher-Order Lazy Functional Slicing
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
Nuno F. Rodrigues, Luís Soares Barbosa
SCAM
2003
IEEE
14 years 21 days ago
Design and Implementation of Bytecode-based Java Slicing System
Program slice is a set of statements that affect the value of variable v in a statement s. In order to calculate a program slice, we must know the dependence relations between sta...
Fumiaki Umemori, Kenji Konda, Reishi Yokomori, Kat...