Computing executable slices for concurrent logic programs

Jianjun Zhao, Jingde Cheng, Kazuo Ushijima

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

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages13-22
Number of pages10
ISBN (Electronic)0769512879, 9780769512877
DOIs
Publication statusPublished - Jan 1 2001
Event2nd Asia-Pacific Conference on Quality Software, APAQS 2001 - Hong Kong, Hong Kong
Duration: Dec 10 2001Dec 11 2001

Publication series

NameProceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001

Other

Other2nd Asia-Pacific Conference on Quality Software, APAQS 2001
CountryHong Kong
CityHong Kong
Period12/10/0112/11/01

Fingerprint

Application programs
Software engineering

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Zhao, J., Cheng, J., & Ushijima, K. (2001). Computing executable slices for concurrent logic programs. In Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001 (pp. 13-22). [989997] (Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/APAQS.2001.989997

Computing executable slices for concurrent logic programs. / Zhao, Jianjun; Cheng, Jingde; Ushijima, Kazuo.

Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001. Institute of Electrical and Electronics Engineers Inc., 2001. p. 13-22 989997 (Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001).

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

Zhao, J, Cheng, J & Ushijima, K 2001, Computing executable slices for concurrent logic programs. in Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001., 989997, Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001, Institute of Electrical and Electronics Engineers Inc., pp. 13-22, 2nd Asia-Pacific Conference on Quality Software, APAQS 2001, Hong Kong, Hong Kong, 12/10/01. https://doi.org/10.1109/APAQS.2001.989997
Zhao J, Cheng J, Ushijima K. Computing executable slices for concurrent logic programs. In Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001. Institute of Electrical and Electronics Engineers Inc. 2001. p. 13-22. 989997. (Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001). https://doi.org/10.1109/APAQS.2001.989997
Zhao, Jianjun ; Cheng, Jingde ; Ushijima, Kazuo. / Computing executable slices for concurrent logic programs. Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001. Institute of Electrical and Electronics Engineers Inc., 2001. pp. 13-22 (Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001).
@inproceedings{c3b5cdde515141df93b3b484e4429b94,
title = "Computing executable slices for concurrent logic programs",
abstract = "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.",
author = "Jianjun Zhao and Jingde Cheng and Kazuo Ushijima",
year = "2001",
month = "1",
day = "1",
doi = "10.1109/APAQS.2001.989997",
language = "English",
series = "Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "13--22",
booktitle = "Proceedings - 2nd Asia-Pacific Conference on Quality Software, APAQS 2001",
address = "United States",

}

TY - GEN

T1 - Computing executable slices for concurrent logic programs

AU - Zhao, Jianjun

AU - Cheng, Jingde

AU - Ushijima, Kazuo

PY - 2001/1/1

Y1 - 2001/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=67749091843&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67749091843&partnerID=8YFLogxK

U2 - 10.1109/APAQS.2001.989997

DO - 10.1109/APAQS.2001.989997

M3 - Conference contribution

AN - SCOPUS:67749091843

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

SP - 13

EP - 22

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

PB - Institute of Electrical and Electronics Engineers Inc.

ER -