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

弱记忆公理化框架的ACL2机制

An ACL2 Mechanization of an Axiomatic Framework for Weak Memory

Benjamin Selfridge

摘要:

证明为多处理器编写的程序的正确性是一个具有挑战性的问题,这在很大程度上是由于大多数现代体系结构提供的内存保证较弱。特别是,存储缓冲区的存在意味着程序员不能再假设对不同位置的写入以相同的顺序对所有处理器可见。然而,所有实际的架构都提供了一个关于跨处理器的内存一致性的较弱保证的集合,这使得程序员能够编写可证明正确的程序,尽管缺乏完全的顺序一致性。在这项工作中,我们提出了一个机械化的ACL 2定理证明的公理弱记忆模型(介绍了Alglave等人)。在此过程中,我们提供了涉及这些公理的既定定理的新证明。

英文摘要:

Proving the correctness of programs written for multiple processors is a challenging problem, due in no small part to the weaker memory guarantees afforded by most modern architectures. In particular, the existence of store buffers means that the programmer can no longer assume that writes to different locations become visible to all processors in the same order. However, all practical architectures do provide a collection of weaker guarantees about memory consistency across processors, which enable the programmer to write provably correct programs in spite of a lack of full sequential consistency. In this work, we present a mechanization in the ACL2 theorem prover of an axiomatic weak memory model (introduced by Alglave et al.). In the process, we provide a new proof of an established theorem involving these axioms.

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

↑