Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/277
Title: A novel approach for computing dynamic slices of object-oriented programs with conditional statements
Authors: Mohapatra, D P
Mall, R
Kumar, R
Keywords: computational complexity
graph theory
object-oriented programming
program slicing
Issue Date: 2004
Publisher: IEEE
Citation: Proceedings of the IEEE First India Annual Conference,INDICON 2004, 20-22 December 2004, Kharagpur, India P 478-482
Abstract: We propose a dynamic program slicing technique for object-oriented programs. We introduce the notion of compact dynamic dependence graph (CDDG) which is used as the intermediate program representation. Our dynamic slicing algorithm is based on the CDDG. We show that our algorithm is more time and space efficient than the existing ones. The worst case space complexity of our algorithm is O(n), where n is the number of statements of the program.
Description: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE DOI:10.1109/INDICO.2004.1497799
URI: http://hdl.handle.net/2080/277
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
moha-2004-indicon.pdf270.09 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.