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

基于强迹前缀的预测性监控

Predictive Monitoring with Strong Trace Prefixes

Zhendong Ang, Umang Mathur

AI总结:

该研究通过引入强迹前缀扩展Mazurkiewicz迹理论,在保留原有算法优势的同时提升了预测分析的能力,推导了更高效的保同步数据竞争与死锁检测算法,实验验证了其实用性。

摘要:

运行时预测分析通过识别观测到的执行的所有可行重排空间,并判断其中是否存在违反所需安全属性的情况,提升了传统基于动态分析的bug检测技术的覆盖范围。建模可行重排空间最常用的方法是借助Mazurkiewicz迹等价理论。该框架的简洁性也催生了高效的预测分析方法,并且已成为获取并发程序监控时空高效算法的事实标准手段。在本研究中,我们探讨如何在保留迹推理算法优势的同时,提升其预测能力。为此,我们通过自然嵌入一类我们称之为强迹前缀的前缀,对迹理论进行了扩展。我们利用增强的依赖关系对强迹前缀进行了形式化刻画,研究了其预测能力,并建立了其与此前在数据竞争和死锁预测背景下提出的保同步正确重排概念之间的紧密联系。随后我们证明,尽管预测能力有所增强,在针对共安全属性的预测场景中,强迹前缀依然具备Mazurkiewicz迹的算法优势,并推导出了用于保同步数据竞争和死锁检测的新算法,这些算法在渐近时空开销上更优。我们还证明强迹前缀能够捕获更多模式语言的违规情况。我们实现了所提出的算法,评估结果证实了基于强前缀迹进行推理的实用价值。

英文摘要:

Runtime predictive analyses enhance coverage of traditional dynamic analyses based bug detection techniques by identifying a space of feasible reorderings of the observed execution and determining if any of these witnesses the violation of some desired safety property. The most popular approach for modelling the space of feasible reorderings is through Mazurkiewicz's trace equivalence. The simplicity of the framework also gives rise to efficient predictive analyses, and has been the de facto means for obtaining space and time efficient algorithms for monitoring concurrent programs. In this work, we investigate how to enhance the predictive power of trace-based reasoning, while still retaining the algorithmic benefits it offers. Towards this, we extend trace theory by naturally embedding a class of prefixes, which we call strong trace prefixes. We formally characterize strong trace prefixes using an enhanced dependence relation, study its predictive power and establish a tight connection to the previously proposed notion of synchronization preserving correct reorderings developed in the context of data race and deadlock prediction. We then show that despite the enhanced predictive power, strong trace prefixes continue to enjoy the algorithmic benefits of Mazurkiewicz traces in the context of prediction against co-safety properties, and derive new algorithms for synchronization preserving data races and deadlocks with better asymptotic space and time usage. We also show that strong trace prefixes can capture more violations of pattern languages. We implement our proposed algorithms and our evaluation confirms the practical utility of reasoning based on strong prefix traces.

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

↑