arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2309.01433cs.LOcs.PL
收藏

提升通用弱内存验证中的推理层次(扩展版)

Lifting the Reasoning Level in Generic Weak Memory Verification (Extended Version)

Lara Bargmann, Heike Wehrheim

AI总结:

本文提出基于视图断言语言的抽象证明规则,将通用弱内存验证的推理从低层公理提升至程序构造层次,并在WRC测试上验证,显著减少证明步骤。

摘要:

弱内存模型规定了多核架构上并发程序的语义。针对弱内存模型的推理技术通常专用于某一固定模型,因此验证结果无法迁移到其他内存模型。最近提出的一种基于通过最弱前置条件表达的程序行为公理的通用验证技术,旨在克服这种对特定模型的专一化。然而,由于使用最弱前置条件,推理发生在非常低的层次,即使对于单个语句,也需要应用大量公理来推导程序属性。在本文中,我们将这种通用验证方法中的推理提升到更抽象的层次。基于一种视图断言语言,我们提供了若干新颖的证明规则,用于直接在程序构造的层次上进行推理。我们证明了这些证明规则的正确性,并在写读因果(WRC)测试上进行了实例说明。与基于公理的低层证明相比,所需证明步骤的数量显著减少。

英文摘要:

Weak memory models specify the semantics of concurrent programs on multi-core architectures. Reasoning techniques for weak memory models are often specialized to one fixed model and verification results are hence not transferable to other memory models. A recent proposal of a generic verification technique based on axioms on program behaviour expressed via weakest preconditions aims at overcoming this specialization to dedicated models. Due to the usage of weakest preconditions, reasoning however takes place on a very low level requiring the application of numerous axioms for deriving program properties, even for a single statement. In this paper, we lift reasoning in this generic verification approach to a more abstract level. Based on a view-based assertion language, we provide a number of novel proof rules for directly reasoning on the level of program constructs. We prove soundness of our proof rules and exemplify them on the write-to-read causality (WRC) litmus test. A comparison to the axiom-based low-level proof reveals a significant reduction in the number of required proof steps.

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

↑