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

Leroy和Blazy是对的:他们的记忆模型可靠性证明是可自动化的。

Leroy and Blazy were right: their memory model soundness proof is automatable (Extended Version)

Pedro Barroso, Mário Pereira, António Ravara

摘要:

Xavier Leroy和Sandrine Blazy在2007年使用Coq证明助手对低级命令式语言(如C)的内存模型进行了形式化验证。考虑到他们的形式化基本上是在一阶逻辑中进行的,作者留下的一个问题是,他们的证明是否可以使用一阶逻辑的验证框架自动化。我们接受了挑战,并使用Why3自动化了它们的形式化,大大减少了证明工作。我们系统地遵循Coq证明,并意识到在许多情况下,Why3能够释放所有VC的方式大约是三分之一。此外,仍然需要交互的证明(例如归纳,存在性证明的证人,断言)被分解为我们明确声明的辅助结果。通过这种方式,我们实现了记忆模型的几乎自动的可靠性和安全性证明。尽管如此,我们的发展允许提取一个正确的构造具体的记忆模型,因此比Leroy和Blazy的初步版本更进一步。

英文摘要:

Xavier Leroy and Sandrine Blazy in 2007 conducted a formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C. Considering their formalization was performed essentially in first-order logic, one question left open by the authors was whether their proofs could be automated using a verification framework for first-order logic. We took the challenge and automated their formalization using Why3, significantly reducing the proof effort. We systematically followed the Coq proofs and realized that in many cases at around one third of the way Why3 was able to discharge all VCs. Furthermore, the proofs still requiring interactions (e.g. induction, witnesses for existential proofs, assertions) were factorized isolating auxiliary results that we stated explicitly. In this way, we achieved an almost-automatic soundness and safety proof of the memory model. Nonetheless, our development allows an extraction of a correct-by-construction concrete memory model, going thus further than the preliminary Why version of Leroy and Blazy.

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

↑