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

预测特定计划的所有数据竞争对(扩展版)

Predicting All Data Race Pairs for a Specific Schedule (extended version)

Martin Sulzmann, Kai Stadtmüller

摘要:

我们考虑的问题,数据竞争预测程序的行为是由一个跟踪。跟踪是在程序执行期间记录的程序事件序列。我们采用可重复的发生之前的关系,以表征所有对的事件,在一个比赛中的时间表表现在跟踪。与经典的happens-before关系相比,可扩展的happens-before关系适当地处理了写-读依赖关系,从而避免了误报。挑战是有效地识别所有(可识别的)数据竞争对。我们提出了一个改进的线性时间向量时钟算法来预测许多可重复的数据竞争对。我们引入了二次时间后处理算法来预测所有剩余的数据竞争对。这提高了该领域的技术水平,我们的实验表明,我们的方法可以扩展到现实世界的例子。因此,用户可以系统地检查和修复在特定时间表的竞争中的所有节目位置。

英文摘要:

We consider the problem of data race prediction where the program's behavior is represented by a trace. A trace is a sequence of program events recorded during the execution of the program. We employ the schedulable happens-before relation to characterize all pairs of events that are in a race for the schedule as manifested in the trace. Compared to the classic happens-before relation, the schedulable happens-before relations properly takes care of write-read dependencies and thus avoids false positives. The challenge is to efficiently identify all (schedulable) data race pairs. We present a refined linear time vector clock algorithm to predict many of the schedulable data race pairs. We introduce a quadratic time post-processing algorithm to predict all remaining data race pairs. This improves the state of the art in the area and our experiments show that our approach scales to real-world examples. Thus, the user can systematically examine and fix all program locations that are in a race for a particular schedule.

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

↑