arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.08273cs.SE
收藏

Concolic无边界线程通过环路的可达性总结(扩展技术报告)

Concolic Unbounded-Thread Reachability via Loop Summaries (Extended Technical Report)

Peizun Liu, Thomas Wahl

摘要:

我们提出了一种方法,用于加速显式状态向后搜索算法的任意多个有限状态线程的系统。我们的方法静态地分析程序执行的线程的存在简单的循环。我们展示了如何这样的循环可以被折叠而不近似Presburger算术约束,象征性地总结了沿循环中的多线程程序执行向后搜索算法的效果。因此,随后的显式状态搜索不需要探索状态空间的汇总部分。具体的和象征性的探索相结合,使我们的算法concolic风味。我们证明了这种方法的力量,证明和反驳的安全性无限线程程序。

英文摘要:

We present a method for accelerating explicit-state backward search algorithms for systems of arbitrarily many finite-state threads. Our method statically analyzes the program executed by the threads for the existence of simple loops. We show how such loops can be collapsed without approximation into Presburger arithmetic constraints that symbolically summarize the effect of executing the backward search algorithm along the loop in the multi-threaded program. As a result, the subsequent explicit-state search does not need to explore the summarized part of the state space. The combination of concrete and symbolic exploration gives our algorithm a concolic flavor. We demonstrate the power of this method for proving and refuting safety properties of unbounded-thread programs.

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

↑