Survey on Dynamic Slicing over Distributed Computing
Chandra Prakash Gupta, Irfanur Rahman, Rakesh Kumar Ray · 2015
In this paper, discussed on dynamic program slicing algorithm which simplifies dependence and discussed the intermediate representation of a dynamic program slicing technique a Concurrent System Dependence Graph (CSDG) and intermediate representation of a distributed Java program in the form of a set of Distributed Program Dependence Graphs (DPDG).The algorithm can run parallel on a network of computers, with each node in the network contributing to the dynamic slice in a fully distributed fashion. The approaches discussed will not require any trace files to be maintained. Another advantage of this approach is that a slice is available even before a request for a slice is made. Analysis of the complexities of both the algorithm for dynamic program slicing technique and distributed dynamic slicing in Java