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

Authors:
Soubhagya Sankar Barpanda;Baikuntha Narayan Biswal;Durga Prasad Mohaptra
Affiliations:
National Institute of Technology Rourkela, Rourkela, 769008, India.;National Institute of Technology Rourkela, Rourkela, 769008, India.;National Institute of Technology Rourkela, Rourkela, 769008, India
Venue:
International Journal of Computational Vision and Robotics
Year:
2010

Citing 11
Cited 0

The program dependence graph and its use in optimization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic program slicing

Information Processing Letters
Interprocedural slicing using dependence graphs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Slicing object-oriented software

Proceedings of the 18th international conference on Software engineering
Static slicing of threaded programs

Proceedings of the 1998 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Slicing concurrent programs

Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Dependence Analysis of Parallel and Distributed Programs and Its Applications

APDC '97 Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97)
The program dependence graph in a software development environment

SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Computation of Dynamic Slices for Object-Oriented Concurrent Programs

APSEC '05 Proceedings of the 12th Asia-Pacific Software Engineering Conference
A formalisation of the relationship between forms of program slicing

Science of Computer Programming - Special issue on source code analysis and manipulation (SCAM 2005)
Computing dynamic slices of concurrent object-oriented programs

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

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.