Slicing Concurrent Java Programs
スポンサーリンク
概要
- 論文の詳細を見る
Although many slicing algorithms have been proposed for object-oriented progratns, no slicing algorithm has been proposed which can be used to handle the problem of slicing concurrent Java programs correctly. In this paper, we propose a slicing algorithm for concurrent Java programs. To slice concurrent Java programs, we present a dependence-based representation called Multithreaded Dependence Graph (MDG), which extends previous dependence graphs to represent concurrent Java programs. Finally, we show how static slices of a concurrent Java program can be computed efficiently based on its MDG.
- 一般社団法人情報処理学会の論文
- 1999-03-18