ACM Home Page
Please provide us with feedback. Feedback
Slicing object-oriented java programs
Full text PdfPdf (829 KB)
Source ACM SIGPLAN Notices archive
Volume 36 ,  Issue 4  (April 2001) table of contents
Pages: 33 - 40  
Year of Publication: 2001
ISSN:0362-1340
Authors
Zhenqiang Chen  Department of Computer Science & Engineering, Southeast University, Nanjing 210096, China
Baowen Xu  State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, China
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 52,   Citation Count: 7
Additional Information:

abstract   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/375431.375418
What is a DOI?

ABSTRACT

This paper presents a new approach to represent dependence for object-oriented (OO) Java software. The program dependence graph (PDG) consists of a set of PDGs with tags that are not connected. This new approach distinguishes data members for different objects and represents the effects of polymorphism and dynamic bindings. Based on this model, we introduce the concepts of partial slicing, class slicing and object slicing. In our slicing algorithm, we slice not only statements but also data members in classes, and inter-method slicings are transformed to intra-method slicings.



Collaborative Colleagues:
Zhenqiang Chen: colleagues
Baowen Xu: colleagues