TY - GEN
T1 - Slicing concurrent Java programs
AU - Zhao, Jianjun
N1 - Publisher Copyright:
© 1999 IEEE.
PY - 1999
Y1 - 1999
N2 - Although many slicing algorithms have been proposed for object oriented programs, no slicing algorithm has been proposed which can be used to handle the problem of slicing concurrent Java programs correctly. We propose a slicing algorithm for concurrent Java programs. To slice concurrent Java programs, we present a dependence based representation called multithreaded dependence graph, which extends previous dependence graphs to represent concurrent Java programs. We also show how static slices of a concurrent Java program can be computed efficiently based on its multithreaded dependence graph.
AB - Although many slicing algorithms have been proposed for object oriented programs, no slicing algorithm has been proposed which can be used to handle the problem of slicing concurrent Java programs correctly. We propose a slicing algorithm for concurrent Java programs. To slice concurrent Java programs, we present a dependence based representation called multithreaded dependence graph, which extends previous dependence graphs to represent concurrent Java programs. We also show how static slices of a concurrent Java program can be computed efficiently based on its multithreaded dependence graph.
UR - http://www.scopus.com/inward/record.url?scp=84944332982&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84944332982&partnerID=8YFLogxK
U2 - 10.1109/WPC.1999.777751
DO - 10.1109/WPC.1999.777751
M3 - Conference contribution
AN - SCOPUS:84944332982
T3 - Proceedings - 7th International Workshop on Program Comprehension, IWPC 1999
SP - 126
EP - 133
BT - Proceedings - 7th International Workshop on Program Comprehension, IWPC 1999
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th International Workshop on Program Comprehension, IWPC 1999
Y2 - 5 May 1999 through 7 May 1999
ER -