arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1506.07635cs.PLcs.SE
收藏

从痕迹到证明:证明并发程序安全

From Traces To Proofs: Proving Concurrent Program Safe

Chinmay Narayan, Subodh Sharma, Shibashis Guha, S. Arun-Kumar

摘要:

调度的不确定性是并发程序正确性证明困难的主要原因。最近提出了一个强大的证明策略[6]来证明这些程序的正确性。该方法捕获数据流之间的依赖关系的指令的交错和无错误的线程执行。这些数据流依赖由归纳数据流图(iDFG)表示,简而言之,它表示引起所发现的数据流依赖的并发程序的一组执行。iDFG被进一步转化为替代有限自动机(AFA),以利用有效的自动机理论工具来解决这个问题。在本文中,我们给出了一个新颖的和有效的算法来直接构建AFA捕获的数据流依赖在并发程序执行。我们在ProofTraPar工具中实现了该算法,证明了有限状态循环程序在顺序一致内存模型下的正确性。我们的结果是encouranging和比较有利的现有国家的最先进的工具。

英文摘要:

Nondeterminism in scheduling is the cardinal reason for difficulty in proving correctness of concurrent programs. A powerful proof strategy was recently proposed [6] to show the correctness of such programs. The approach captured data-flow dependencies among the instructions of an interleaved and error-free execution of threads. These data-flow dependencies were represented by an inductive data-flow graph (iDFG), which, in a nutshell, denotes a set of executions of the concurrent program that gave rise to the discovered data-flow dependencies. The iDFGs were further transformed in to alternative finite automatons (AFAs) in order to utilize efficient automata-theoretic tools to solve the problem. In this paper, we give a novel and efficient algorithm to directly construct AFAs that capture the data-flow dependencies in a concurrent program execution. We implemented the algorithm in a tool called ProofTraPar to prove the correctness of finite state cyclic programs under the sequentially consistent memory model. Our results are encouranging and compare favorably to existing state-of-the-art tools.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑