arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.1629cs.LOcs.PL
收藏

并发软件有效BMC的偏序

Partial Orders for Efficient BMC of Concurrent Software

Jade Alglave, Daniel Kroening, Michael Tautschnig

摘要:

并发程序中存在的大量交织是导致并发软件自动分析困难的根本原因。人们普遍认为,记忆力差会使这个问题更加困难。我们解决这两个问题的建模程序的执行与偏序,而不是交错语义(SC)。基于这些思想,我们实现了一个软件分析工具。它可以扩展到足够大的程序,以实现对各种型号(包括SC、Intel x86和IBM Power)上的非平凡并发系统代码的首次形式化验证。

英文摘要:

The vast number of interleavings that a concurrent program can have is typically identified as the root cause of the difficulty of automatic analysis of concurrent software. Weak memory is generally believed to make this problem even harder. We address both issues by modelling programs' executions with partial orders rather than the interleaving semantics (SC). We implemented a software analysis tool based on these ideas. It scales to programs of sufficient size to achieve first-time formal verification of non-trivial concurrent systems code over a wide range of models, including SC, Intel x86 and IBM Power.

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

↑