Please use this identifier to cite or link to this item:
Title: Distributed dynamic slicing of Java programs
Authors: Mohapatra, D P
Kumar, R
Mall, R
Kumar, D S
Bhasin, M
Keywords: Program slicing
Dynamic slicing
Program dependence graph
Object-oriented program
Distributed programming
Issue Date: 2006
Publisher: Elsevier
Citation: Journal of Systems and Software, (Accepted Postprint)
Abstract: We propose a novel dynamic slicing technique for distributed Java programs. We first construct the intermediate representation of a distributed Java program in the form of a set of Distributed Program Dependence Graphs (DPDG). We mark and unmark the edges of the DPDG appropriately as and when dependencies arise and cease during run-time. Our algorithm can run parallely on a network of computers, with each node in the network contributing to the dynamic slice in a fully distributed fashion. Our approach does not require any trace files to be maintained. Another advantage of our approach is that a slice is available even before a request for a slice is made. This appreciably reduces the response time of slicing commands. We have implemented the algorithm in a distributed environment. The results obtained from our experiments show promise
Description: Copyright for this article belongs to Elsevier Science Ltd
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
DistSlicing.pdf559.16 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.