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

数量最强职位

Quantitative Strongest Post

Linpeng Zhang, Benjamin Lucien Kaminski

摘要:

我们提出了一种新的最强后置条件式演算的定量推理的非确定性程序的循环。现有的定量最弱前允许推理程序在给定的初始状态终止后的量的值,定量最强后允许推理程序执行并达到给定的最终状态之前的量的值。我们展示了如何最强的职位,使推理的定量信息流通过程序。与最弱的自由主义前提条件类似,我们也发展了一个数量上最强的自由主义职位。作为一个副产品,我们获得了完全未经探索的最强自由后置条件的概念,并显示这些预示着一个潜在的新的程序逻辑-部分不正确逻辑-这将是一个更自由的版本奥赫恩最近的不正确逻辑。

英文摘要:

We present a novel strongest-postcondition-style calculus for quantitative reasoning about non-deterministic programs with loops. Whereas existing quantitative weakest pre allows reasoning about the value of a quantity after a program terminates on a given initial state, quantitative strongest post allows reasoning about the value that a quantity had before the program was executed and reached a given final state. We show how strongest post enables reasoning about the flow of quantitative information through programs. Similarly to weakest liberal preconditions, we also develop a quantitative strongest liberal post. As a byproduct, we obtain the entirely unexplored notion of strongest liberal postconditions and show how these foreshadow a potential new program logic - partial incorrectness logic - which would be a more liberal version of O'Hearn's recent incorrectness logic.

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

↑