基于视图的持久x86-TSO（扩展版）Owicki-Gries推理
View-Based Owicki-Gries Reasoning for Persistent x86-TSO (Extended Version)
摘要：
持久内存的兴起正在颠覆计算的核心。我们的工作旨在帮助程序员导航这个勇敢的新世界，通过提供一个程序逻辑推理x86代码，使用低级操作，如内存访问和围栏，以及持久化原语，如刷新。我们的逻辑，Pierogi，受益于一个简单的底层操作语义的基础上的意见，能够处理优化的刷新操作，并在伊莎贝尔/HOL证明助手机械化。我们详细介绍了Pierogi的证明规则，并证明了它们的声音。我们还展示了如何Pierogi可以用来推理一系列具有挑战性的单线程和多线程持久程序。
英文摘要：
The rise of persistent memory is disrupting computing to its core. Our work aims to help programmers navigate this brave new world by providing a program logic for reasoning about x86 code that uses low-level operations such as memory accesses and fences, as well as persistency primitives such as flushes. Our logic, Pierogi, benefits from a simple underlying operational semantics based on views, is able to handle optimised flush operations, and is mechanised in the Isabelle/HOL proof assistant. We detail the proof rules of Pierogi and prove them sound. We also show how Pierogi can be used to reason about a range of challenging single- and multi-threaded persistent programs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
