An approach to find dynamic slice for C++ Program

Computer Science – Programming Languages

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Submitted to Journal of Computer Science and Engineering, see http://sites.google.com/site/jcseuk/volume-1-issue-1-may-2010

Scientific paper

Object-oriented programming has been considered a most promising method in program development and maintenance. An important feature of object-oriented programs (OOPs) is their reusability which can be achieved through the inheritance of classes or reusable components.Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains only those statements that actually affect the variables in the slicing criterion. This paper proposes a method to dynamically slice object-oriented (00) programs based on dependence analysis. It uses the Control Dependency Graph for object program and other static information to reduce the information to be traced during program execution. In this paper we present a method to find the dynamic Slice of object oriented programs where we are finding the slices for object and in case of function overloading.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An approach to find dynamic slice for C++ Program does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An approach to find dynamic slice for C++ Program, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An approach to find dynamic slice for C++ Program will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-423138

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.