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

为预测监控参数化读取-从等价性

Parametrizing Reads-From Equivalence for Predictive Monitoring

University of Toronto(多伦多大学);National University of Singapore(新加坡国立大学)

Azadeh Farzan, Umang Mathur

AI总结:

本文提出k-sliced重排作为参数化方法,通过分层结构在计算成本与表达能力间取得平衡,为预测监控提供统一框架。

摘要:

预测运行时监控询问是否可以利用并发程序执行σ来可靠预测满足属性φ的重排ρ的存在性。其有效性和效率取决于两个因素:(a)φ的复杂性,和(b)所考虑的重排的表达能力。在极端情况下,允许所有由读取-从等价性诱导的重排使预测监控难以处理,即使对于简单的数据竞争属性也是如此。在另一极端,限制到基于交换性的重排(Mazurkiewicz轨迹等价)会产生高效的算法,但对一般正则规范仍难以处理。本文通过参数化方法解决这一权衡,引入切片重排及其一般化k-切片重排。形式上,ρ是σ的k-切片重排,如果σ可以被分成k+1个有序子序列,其拼接结果为ρ,同时保持程序顺序和读取-从约束。结果分为两部分:首先,k-切片重排形成严格递增的层次结构,随着k的增大趋近于读取-从等价性。其次,对于任何固定的k,针对任何正则规范的k-切片重排预测监控具有常空间流算法。这些结果确立k-切片重排作为现有等价性的替代方案,为预测监控提供统一的参数化框架,使表达能力可以系统地与计算成本进行权衡。

英文摘要:

Predictive runtime monitoring asks whether an execution $σ$ of a concurrent program can be used to \emph{soundly predict} the existence of a reordering $ρ$ of $σ$ that satisfies a property $φ$. Its effectiveness and efficiency depend on two factors: (a) the complexity of $φ$, and (b) the expressive power of the reorderings considered. At one extreme, allowing all reorderings induced by \emph{reads-from equivalence} makes predictive monitoring intractable, even for simple properties such as data races. At the other extreme, restricting to commutativity-based reorderings (Mazurkiewicz trace equivalence) yields efficient algorithms for simple properties, but remains intractable for general regular specifications and offers limited predictive power. We address this tradeoff via \emph{parametrization}. We introduce \emph{sliced reorderings} and their generalization, \emph{$k$-sliced reorderings}. Informally, $ρ$ is a $k$-sliced reordering of $σ$ if $σ$ can be partitioned into $k+1$ ordered subsequences whose concatenation yields $ρ$, while preserving program order and reads-from constraints. Our results are twofold. First, $k$-sliced reorderings form a strictly increasing hierarchy that converges to reads-from equivalence as $k$ grows. Second, for any fixed $k$, predictive monitoring modulo $k$-sliced reorderings against any regular specification admits a constant-space streaming algorithm. Together, these results establish $k$-sliced reorderings as a principled alternative to existing equivalences, enabling a uniform parametrized framework where expressive power can be systematically traded off against computational cost.

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

↑