A graph coloring approach to slicing of object-oriented programs

Authors:
S. S. Barpanda;B. N. Biswal;D. Mohapatra
Affiliations:
N.I.T. Rourkela, India;N.I.T. Rourkela, India;N.I.T. Rourkela, India
Venue:
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Year:
2010

Citing 5
Cited 0

Slicing object-oriented software

Proceedings of the 18th international conference on Software engineering
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
A formalisation of the relationship between forms of program slicing

Science of Computer Programming - Special issue on source code analysis and manipulation (SCAM 2005)
Theoretical foundations of dynamic program slicing

Theoretical Computer Science
Computing dynamic slices of concurrent object-oriented programs

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The wide spread interest in slicing of object-oriented software has led to the birth of number of algorithms. Nowadays, slicing of object-oriented programs has picked up the momentum as most of the real world programs are object-oriented in nature. The algorithms which are available of-the-self, address different issues in their own ways. In this paper, we propose a new algorithm which incorporates graph coloring technique. But in order to compute the dynamic slice, we have contradicted some key constraints of graph coloring algorithm. The advantage of our algorithm is that it is faster and the process of computing slice can be optimized further.