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

小步长Cminor的分离逻辑

Separation Logic for Small-step Cminor

Andrew W. Appel, Sandrine Blazy

摘要:

Cminor是一种中级命令式程序设计语言;从C到Cminor以及从Cminor到机器语言都有被证明是正确的优化编译器。我们重新设计了Cminor,使其适合霍尔逻辑推理,并且我们为Cminor设计了一个分离逻辑。在本文中,我们给出了一个小步骤的语义(而不是大步骤的证明正确的编译器),这是出于需要支持未来的并发扩展。我们详细介绍了我们的分离逻辑的可靠性的机器检查证明。这是分离逻辑w.r.t.的第一个大规模机器检验证明。一个小步骤的语义。本文的工作已在Coq证明助手中实现。这是迈向并发Cminor程序可以使用分离逻辑进行验证的环境的第一步,也可以通过具有正式端到端正确性保证的证明正确的编译器进行编译。

英文摘要:

Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor so that it is suitable for Hoare Logic reasoning and we have designed a Separation Logic for Cminor. In this paper, we give a small-step semantics (instead of the big-step of the proved-correct compiler) that is motivated by the need to support future concurrent extensions. We detail a machine-checked proof of soundness of our Separation Logic. This is the first large-scale machine-checked proof of a Separation Logic w.r.t. a small-step semantics. The work presented in this paper has been carried out in the Coq proof assistant. It is a first step towards an environment in which concurrent Cminor programs can be verified using Separation Logic and also compiled by a proved-correct compiler with formal end-to-end correctness guarantees.

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

↑