Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMohapatra, D P-
dc.contributor.authorMall, R-
dc.contributor.authorKumar, R-
dc.identifier.citationProceedings of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004. Hongkong, China, P 60-65en
dc.descriptionPersonal 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/CMPSAC.2004.1342806en
dc.description.abstractWe propose a new dynamic slicing technique for object-oriented programs that is more efficient than the related algorithms. We use an extended system dependence graph (ESDG) as the intermediate program representation. Our dynamic slicing algorithm is based on marking and unmarking the edges in the ESDG as and when dependencies arise and cease during runtime.en
dc.format.extent723001 bytes-
dc.subjectobject-oriented programmingen
dc.subjectprogram slicingen
dc.titleAn edge marking technique for dynamic slicing of object-oriented programsen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
moha-2004-hkconf.pdf706.06 kBAdobe PDFView/Open

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