.png){kind=icon}
返回
Evaluating deadlock detection methods for concurrent software
.png){kind=icon}
PRE
AI
DOI：10.1109/32.489078.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Static analysis of concurrent programs has been hindered by the well known state explosion problem. Although many different techniques have been proposed to combat this state explosion, there is little empirical data comparing the performance of the methods. This information is essential for assessing the practical value of a technique and for choosing the best method for a particular problem. In this paper, we carry out an evaluation of three techniques for combating the state explosion problem in deadlock detection: reachability search with a partial order state space reduction, symbolic model checking, and inequality necessary conditions. We justify the method used for the comparison, and carefully analyze several sources of potential bias. The results of our evaluation provide valuable data on the kinds of programs to which each technique might best be applied. Furthermore, we believe that the methodological issues we discuss are of general significance in comparison of analysis techniques.
Keyword:
concurrency analysis
empirical evaluation
state space reduction
symbolic model checking
inequality necessary conditions
Ada tasking
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.6
论文数:
2.8K
被引数:
1.1W
机构
暂无机构信息
引用论文
STRUCTURAL ANALYSIS OF THE dur LOCI IN S. CEREVISIAE: TWO DOMAINS OF A SINGLE MULTIFUNCTIONAL GENE.png)
Genetics
OAAI
GeneticsIF0
OAAI分享收藏
查看更多内容