Slicing concurrent Java programs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

49 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 7th International Workshop on Program Comprehension, IWPC 1999
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages126-133
Number of pages8
ISBN (Electronic)0769501796, 9780769501796
DOIs
Publication statusPublished - Jan 1 1999
Externally publishedYes
Event7th International Workshop on Program Comprehension, IWPC 1999 - Pittsburgh, United States
Duration: May 5 1999May 7 1999

Publication series

NameProceedings - 7th International Workshop on Program Comprehension, IWPC 1999

Other

Other7th International Workshop on Program Comprehension, IWPC 1999
CountryUnited States
CityPittsburgh
Period5/5/995/7/99

All Science Journal Classification (ASJC) codes

  • Software
  • Cognitive Neuroscience

Cite this

Zhao, J. (1999). Slicing concurrent Java programs. In Proceedings - 7th International Workshop on Program Comprehension, IWPC 1999 (pp. 126-133). [777751] (Proceedings - 7th International Workshop on Program Comprehension, IWPC 1999). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/WPC.1999.777751