检索结果-内蒙古大学图书馆

Proceedings of the 2001 annual ACM SIGAda international conference on Ada

作者： Zhenqiang Chen Baowen Xu Huiming Yu Southeast University Nanjing 210096 China North Carolina A&T State University Greensboro NC

ISBN: (纸本)9781581133929

Information about which pairs of statements in a program can be executed concurrently is important for improving the accuracy of dataflow analysis, optimizing programs, and detecting errors. This paper presents a new method named Concurrent Control Flow Graph for representing concurrent Ada 95 programs in a simple and precise way. Based on this method, we develop an Adapted mhp algorithm that can statically detect all pairs of statements that may be executed concurrently. This algorithm checks not only whether a rendezvous can be triggered, but also whether it can be finished. Although this algorithm generates a conservative superset of the perfect pairs of statements, it is more precise than many existing methods.

关键词： program analysis Concurrent program mhp algorithm control flow graph

来源：评论

学校读者我要写书评

暂无评论

Concurrent Ada dead statements detection

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2002年第13期44卷 733-741页

作者： Chen, ZQ Xu, BW Yang, HJ Zhao, JJ SE Univ Dept Comp Sci & Engn Nanjing 210096 Peoples R China Wuhan Univ State Key Lab Software Engn Wuhan 430072 Peoples R China De Montfort Univ Dept Comp Sci Leicester LE1 9BH Leics England Fukuoka Inst Technol Dept Comp Sci & Engn Fukuoka Japan

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.

关键词： concurrent program flow graph mhp algorithm dead statements rendezvous

来源：评论

学校读者我要写书评

暂无评论

Detecting dead statements for concurrent programs 1

Detecting dead statements for concurrent programs

引用

1st IEEE International Workshop on Source Code Analysis and Manipulation

作者： Chen, ZQ Xu, BW Yang, HJ SE Univ Dept Comp Sci & Engn Nanjing 210096 Peoples R China

ISBN: (纸本)0769513875

With more and more concurrent programs being used in practice, technique and tools to analyze such programs are urgently needed. Due to the schedule, race conditions and synchronization among processes (threads), some statements may never be executed. Such statements are dead statements and have no influence on the programs except make them more difficult to analyze and understand. Therefore, this paper develops a data flow approach to detect dead statements for concurrent programs. In this method concurrent programs are represented by concurrent control flow graphs in a simple and precise way, and detecting rules arc extracted by analyzing program behaviors. Based on these rules, we propose a dead statement-detecting algorithm.

关键词： concurrent program flow graph mhp algorithm dead statements rendezvous

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：