Concurrent Ada dead statements detection

Zhenqiang Chen, Baowen Xu, Hongji Yang, Jianjun Zhao

研究成果: ジャーナルへの寄稿Conference article

4 引用 (Scopus)

抄録

In a concurrent environment, due to schedule, race conditions and synchronisation among concurrent units, some program statements may never be executed. Such statements are dead statements and have no influence on the programs except making them more difficult to analyse and understand. Since the execution of concurrent programs is non-deterministic, it is hard to detect dead statements. In this paper, we develop a data flow approach to detect dead statements for concurrent Ada programs. In this method, concurrent Ada programs are represented by concurrent control flow graphs in a simple and precise way, and detecting rules are extracted by analysing program behaviours. Based on these rules, a dead statement detecting algorithm is proposed.

元の言語英語
ページ(範囲)733-741
ページ数9
ジャーナルInformation and Software Technology
44
発行部数13
DOI
出版物ステータス出版済み - 10 1 2002
外部発表Yes
イベントSCAM - Montreal, Alta., カナダ
継続期間: 10 1 200210 1 2002

Fingerprint

Hazards and race conditions
Flow graphs
Synchronization

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Computer Science Applications

これを引用

Concurrent Ada dead statements detection. / Chen, Zhenqiang; Xu, Baowen; Yang, Hongji; Zhao, Jianjun.

:: Information and Software Technology, 巻 44, 番号 13, 01.10.2002, p. 733-741.

研究成果: ジャーナルへの寄稿Conference article

Chen, Zhenqiang ; Xu, Baowen ; Yang, Hongji ; Zhao, Jianjun. / Concurrent Ada dead statements detection. :: Information and Software Technology. 2002 ; 巻 44, 番号 13. pp. 733-741.
@article{571b8561c8a44ae8a4aaf6aad8651690,
title = "Concurrent Ada dead statements detection",
abstract = "In a concurrent environment, due to schedule, race conditions and synchronisation among concurrent units, some program statements may never be executed. Such statements are dead statements and have no influence on the programs except making them more difficult to analyse and understand. Since the execution of concurrent programs is non-deterministic, it is hard to detect dead statements. In this paper, we develop a data flow approach to detect dead statements for concurrent Ada programs. In this method, concurrent Ada programs are represented by concurrent control flow graphs in a simple and precise way, and detecting rules are extracted by analysing program behaviours. Based on these rules, a dead statement detecting algorithm is proposed.",
author = "Zhenqiang Chen and Baowen Xu and Hongji Yang and Jianjun Zhao",
year = "2002",
month = "10",
day = "1",
doi = "10.1016/S0950-5849(02)00106-4",
language = "English",
volume = "44",
pages = "733--741",
journal = "Information and Software Technology",
issn = "0950-5849",
publisher = "Elsevier",
number = "13",

}

TY - JOUR

T1 - Concurrent Ada dead statements detection

AU - Chen, Zhenqiang

AU - Xu, Baowen

AU - Yang, Hongji

AU - Zhao, Jianjun

PY - 2002/10/1

Y1 - 2002/10/1

N2 - In a concurrent environment, due to schedule, race conditions and synchronisation among concurrent units, some program statements may never be executed. Such statements are dead statements and have no influence on the programs except making them more difficult to analyse and understand. Since the execution of concurrent programs is non-deterministic, it is hard to detect dead statements. In this paper, we develop a data flow approach to detect dead statements for concurrent Ada programs. In this method, concurrent Ada programs are represented by concurrent control flow graphs in a simple and precise way, and detecting rules are extracted by analysing program behaviours. Based on these rules, a dead statement detecting algorithm is proposed.

AB - In a concurrent environment, due to schedule, race conditions and synchronisation among concurrent units, some program statements may never be executed. Such statements are dead statements and have no influence on the programs except making them more difficult to analyse and understand. Since the execution of concurrent programs is non-deterministic, it is hard to detect dead statements. In this paper, we develop a data flow approach to detect dead statements for concurrent Ada programs. In this method, concurrent Ada programs are represented by concurrent control flow graphs in a simple and precise way, and detecting rules are extracted by analysing program behaviours. Based on these rules, a dead statement detecting algorithm is proposed.

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

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

U2 - 10.1016/S0950-5849(02)00106-4

DO - 10.1016/S0950-5849(02)00106-4

M3 - Conference article

AN - SCOPUS:0036783809

VL - 44

SP - 733

EP - 741

JO - Information and Software Technology

JF - Information and Software Technology

SN - 0950-5849

IS - 13

ER -