Slicing concurrent Java programs

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

49 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルProceedings - 7th International Workshop on Program Comprehension, IWPC 1999
出版社Institute of Electrical and Electronics Engineers Inc.
ページ126-133
ページ数8
ISBN(電子版)0769501796, 9780769501796
DOI
出版ステータス出版済み - 1 1 1999
外部発表はい
イベント7th International Workshop on Program Comprehension, IWPC 1999 - Pittsburgh, 米国
継続期間: 5 5 19995 7 1999

出版物シリーズ

名前Proceedings - 7th International Workshop on Program Comprehension, IWPC 1999

その他

その他7th International Workshop on Program Comprehension, IWPC 1999
国/地域米国
CityPittsburgh
Period5/5/995/7/99

All Science Journal Classification (ASJC) codes

  • ソフトウェア
  • 認知神経科学

引用スタイル