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

动态创建线程并发程序的上下文有界分析

Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads

Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer

摘要:

上下文有界分析已被证明是高效和有效地发现并发程序中的错误。根据其最初的定义,上下文有界分析探索并发程序的所有行为,直到线程之间的上下文切换达到一定数量。这个定义不适用于动态创建线程的程序,因为限制计算中上下文切换的数量也限制了计算中涉及的线程数量。在本文中,我们提出了一个更一般的定义上下文有界分析有用的程序与动态线程创建。其思想是限制每个线程的上下文切换次数,而不是限制所有线程的切换次数。我们认为几个变种的基础上,这个新的定义,我们建立的可判定性和复杂性的结果,由它们引起的分析。

英文摘要:

Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis explores all behaviors of a concurrent program up to some fixed number of context switches between threads. This definition is inadequate for programs that create threads dynamically because bounding the number of context switches in a computation also bounds the number of threads involved in the computation. In this paper, we propose a more general definition of context-bounded analysis useful for programs with dynamic thread creation. The idea is to bound the number of context switches for each thread instead of bounding the number of switches of all threads. We consider several variants based on this new definition, and we establish decidability and complexity results for the analysis induced by them.

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

↑