Dynamic slicing of distributed object-oriented programs

Program slicing is a decomposition technique that deals with extracting those statements relevant to a particular computation. The authors propose a novel algorithm for computing dynamic slice of distributed object-oriented programs. The proposed algorithm incorporates graph colouring strategy to compute slice. But to achieve the goal efficiently, the authors have contradicted some key constraints of the traditional graph colouring technique. The state restriction of the slicing criterion is also considered along with dependence analysis while computing slice. The advantage of the proposed algorithm is that it is efficient and faster than the existing algorithms.