Concurrent Ada dead statements detection

Zhenqiang Chen, Baowen Xu, Hongji Yang, Jianjun Zhao

Research output: Contribution to journalConference articlepeer-review

5 Citations (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.

Original languageEnglish
Pages (from-to)733-741
Number of pages9
JournalInformation and Software Technology
Issue number13
Publication statusPublished - Oct 1 2002
Externally publishedYes
EventSCAM - Montreal, Alta., Canada
Duration: Oct 1 2002Oct 1 2002

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Concurrent Ada dead statements detection'. Together they form a unique fingerprint.

Cite this