Author:
Bergstra J.A.,Tucker J.V.
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. Ten years of Hoare's logic, a survey;Apt,1979
2. Recursive assertions are not enough—or are they?;Apt;Theoret. Comput. Sci.,1979
3. R.J.R. Back, Proving total correctness of nondeterministic programs in infinitary logic, Acta Informat., to appear.
4. Mathematical Theory of Program Correctness;de Bakker,1980
5. J.A. Bergstra, J. Tiuryn and J.V. Tucker, Floyd's principle, correctness theories and program equivalence, Theoret. Comput. Sci., to appear.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fifty years of Hoare’s logic;Formal Aspects of Computing;2019-12
2. Inadequacy of computable loop invariants;ACM Transactions on Computational Logic;2001-01
3. Weakly expressive models for Hoare logic;Theoretical Computer Science;1991-05
4. Correctness of programs over poor signatures;Lecture Notes in Computer Science;1991
5. Methods and Logics for Proving Programs;Formal Models and Semantics;1990