ACM Home Page
Please provide us with feedback. Feedback
Slicing concurrent java programs
Full text PdfPdf (702 KB)
Source ACM SIGPLAN Notices archive
Volume 36 ,  Issue 4  (April 2001) table of contents
Pages: 41 - 47  
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): 3,   Downloads (12 Months): 30,   Citation Count: 8
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.375420
What is a DOI?

ABSTRACT

Program slicing is an important approach to testing, understanding and maintaining programs. The paper presents a slicing algorithm for concurrent Java programs. Because the execution process of concurrent programs is unpredictable, there are many problems to be solved when slicing. To slice concurrent Java programs, we present concurrent control flow graphs and concurrent program dependence graphs to representconcurrent Java programs. Based on these models, we design an efficient static slicing algorithm for concurrent Java programs. The algorithm may get more precise slices than previous approaches we know.



Collaborative Colleagues:
Zhenqiang Chen: colleagues
Baowen Xu: colleagues