.png){kind=icon}
返回
Concurrent Ada dead statements detection
.png){kind=icon}
PRE
AI
DOI：10.1016/S0950-5849(02)00106-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
concurrent program flow graph
MHP algorithm
dead statements
rendezvous
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
3.8K
被引数:
7.7K
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容