On Hoare logic and Kleene algebra with tests

On Hoare logic and Kleene algebra with tests
复制标题

霍尔逻辑和克林代数的检验

DOI:
10.1109/lics.1999.782610
复制
发表时间:
1999
期刊:
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
影响因子:
--
通讯作者:
D. Kozen
D. Kozen
中科院分区:
--
文献类型:
--
作者:
D. Kozen

文献摘要

被引文献

相似文献

我们表明,Kleene代数具有测试属性命题Hoare逻辑。因此,Hoare逻辑的专业语法和演绎仪是不必要的,可以用简单的方程推理代替。我们使用这种降低表明,命题hoare逻辑是pspace complete。
We show that Kleene algebra with tests subsumes propositional Hoare logic. Thus the specialized syntax and deductive apparatus of Hoare logic are inessential and can be replaced by simple equational reasoning. We show using this reduction that propositional Hoare logic is PSPACE-complete.