Title :
Slicing concurrent Java programs
Author_Institution :
Dept. of Comput. Sci. & Eng., Fukuoka Inst. of Technol., Japan
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;
Conference_Titel :
Program Comprehension, 1999. Proceedings. Seventh International Workshop on
Conference_Location :
Pittsburgh, PA
Print_ISBN :
0-7695-0180-x
DOI :
10.1109/WPC.1999.777751