DocumentCode :
2959283
Title :
Slicing concurrent Java programs
Author :
Zhao, Jianjun
Author_Institution :
Dept. of Comput. Sci. & Eng., Fukuoka Inst. of Technol., Japan
fYear :
1999
fDate :
1999
Firstpage :
126
Lastpage :
133
Abstract :
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
Keywords :
Java; graph theory; multi-threading; program slicing; concurrent Java program slicing; dependence based representation; multithreaded dependence graph; object oriented programs; slicing algorithms; static slices; Java; Yarn;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Program Comprehension, 1999. Proceedings. Seventh International Workshop on
Conference_Location :
Pittsburgh, PA
ISSN :
1092-8138
Print_ISBN :
0-7695-0180-x
Type :
conf
DOI :
10.1109/WPC.1999.777751
Filename :
777751
Link To Document :
بازگشت