Slicing Concurrent Java Programs

  • Authors:
  • Jianjun Zhao

  • Affiliations:
  • -

  • Venue:
  • IWPC '99 Proceedings of the 7th International Workshop on Program Comprehension
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

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. 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, 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.