Dynamic Slicing of Object-Oriented Programs

Gompa, Jaya Teja (2014) Dynamic Slicing of Object-Oriented Programs. BTech thesis.



Software maintenance activity is one of the most important part of software development cycle. Certain regions of a program cause more damage than other regions resulting in errors, if they contain bugs. So, it is important to debug and find those areas. We use slicing criteria to obtain a static backward slice of a program to find these areas. An intermediate graphical representation is obtained for an input source program such as the Program Dependence Graph, the Class Dependence Graph and the System Dependence Graph. Slicing is performed on the System Dependence Graph using a two pass graph reachability algorithm proposed by Horwitz[3], and a static backward slice is obtained. After obtaining static slice, dynamic slice is calculated for the given input variable using an algorithm where in a statement, a set of variables and the input values for these variables are taken as input and a dynamic slice is obtained.

Item Type:Thesis (BTech)
Uncontrolled Keywords:Program slicing; dynamic slicing; object-oriented programs; Redundant Edge Removal Algorithm
Subjects:Engineering and Technology > Computer and Information Science
Divisions: Engineering and Technology > Department of Computer Science
ID Code:6203
Deposited By:Hemanta Biswal
Deposited On:28 Aug 2014 16:24
Last Modified:28 Aug 2014 16:24
Supervisor(s):Mohapatra, D P

Repository Staff Only: item control page