arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.07707cs.PLcs.CL
收藏

关于不正确逻辑与带Top和检验的Kleene代数

On Incorrectness Logic and Kleene Algebra with Top and Tests

Boston University(波士顿大学)

Cheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi

摘要:

带有测试的Kleene代数(KAT)是一个用于程序推理的基本方程框架,它在程序转换,网络和编译器优化等许多领域都有应用。在他的开创性工作中,Kozen证明了KAT包含命题霍尔逻辑,表明人们可以通过KAT的方程理论来推理while程序的(部分)正确性。在这项工作中,我们调查的支持,KAT提供的推理不正确,而不是体现Ohearn最近提出的不正确的逻辑。我们表明,KAT不能直接表示不正确逻辑。这种限制的主要原因可以追溯到这样一个事实,即KAT不能明确表达的概念,这是必不可少的表示不正确的三元组的上域。为了解决这个问题,我们研究Kleene代数与顶部和测试(TopKAT),KAT的扩展与顶部元素。我们表明,TopKAT是强大的,足以表示一个codomain操作,表示不正确的三元组,并证明所有的规则不正确的逻辑声音。这表明人们可以通过TopKAT的等式理论来推断while类程序的不正确性。

英文摘要:

Kleene algebra with tests (KAT) is a foundational equational framework for reasoning about programs, which has found applications in program transformations, networking and compiler optimizations, among many other areas. In his seminal work, Kozen proved that KAT subsumes propositional Hoare logic, showing that one can reason about the (partial) correctness of while programs by means of the equational theory of KAT. In this work, we investigate the support that KAT provides for reasoning about incorrectness, instead, as embodied by Ohearn's recently proposed incorrectness logic. We show that KAT cannot directly express incorrectness logic. The main reason for this limitation can be traced to the fact that KAT cannot express explicitly the notion of codomain, which is essential to express incorrectness triples. To address this issue, we study Kleene Algebra with Top and Tests (TopKAT), an extension of KAT with a top element. We show that TopKAT is powerful enough to express a codomain operation, to express incorrectness triples, and to prove all the rules of incorrectness logic sound. This shows that one can reason about the incorrectness of while-like programs by means of the equational theory of TopKAT.

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

↑