Title: Contradictory graph colouring algorithm to compute slice of concurrent object-oriented programs

Authors: Soubhagya Sankar Barpanda, Baikuntha Narayan Biswal, Durga Prasad Mohaptra

Addresses: National Institute of Technology Rourkela, Rourkela, 769008, India. ' National Institute of Technology Rourkela, Rourkela, 769008, India. ' National Institute of Technology Rourkela, Rourkela, 769008, India

Abstract: In this paper, we propose a dynamic program slicing technique for concurrent object-oriented programs. Our technique uses the graph colouring algorithm. But in order to compute the slices, we have contradicted some facts of the traditional graph colouring algorithm. We have used the concurrent system dependence graph as the intermediate representation for the program under consideration. The advantage of our algorithm is that it eliminates the use of trace file. Since we are incorporating graph colouring scheme, we efficiently compute the slices from a graph compared to the other existing algorithms.

Keywords: program slicing; graph colouring; concurrency; program projection theory; concurrent system dependence graph; CSDG; object-oriented programming; OOP.

DOI: 10.1504/IJCVR.2010.036079

International Journal of Computational Vision and Robotics, 2010 Vol.1 No.2, pp.158 - 168

Published online: 17 Oct 2010 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article