Computing executable slices for concurrent logic programs

Jianjun Zhao, Jingde Cheng, Kazuo Ushijima

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

4 被引用数 (Scopus)

抄録

Program Slicing has many applications an software engineering activities. However, until recently, no slicing algorithm has been presented that can compute executable slices for concurrent logic programs. In this paper we present a dependence-graph bused approach to computing executable slice for concurrent logic programs. The dependence-bused representation used in this paper is called the Argument Dependence Net which can be wed to explicitly represent various types of program dependences an a concurrent logic program. Based on the ADN, we can compute static executable slices for concurrent logic programs at argument level.

本文言語英語
ホスト出版物のタイトルProceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001
出版社Institute of Electrical and Electronics Engineers Inc.
ページ13-22
ページ数10
ISBN(電子版)0769512879, 9780769512877
DOI
出版ステータス出版済み - 1月 1 2001
外部発表はい
イベント2nd Asia-Pacific Conference on Quality Software, APAQS 2001 - Hong Kong, 香港
継続期間: 12月 10 200112月 11 2001

出版物シリーズ

名前Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001

その他

その他2nd Asia-Pacific Conference on Quality Software, APAQS 2001
国/地域香港
CityHong Kong
Period12/10/0112/11/01

!!!All Science Journal Classification (ASJC) codes

  • ソフトウェア

フィンガープリント

「Computing executable slices for concurrent logic programs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル