Contradictory graph colouring algorithm to compute slice of concurrent object-oriented programs
by Soubhagya Sankar Barpanda, Baikuntha Narayan Biswal, Durga Prasad Mohaptra
International Journal of Computational Vision and Robotics (IJCVR), Vol. 1, No. 2, 2010

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.

Online publication date: Sun, 17-Oct-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Vision and Robotics (IJCVR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com