Two theorems about the completeness of Hoare's logic
- 1 October 1982
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 15 (4) , 143-149
- https://doi.org/10.1016/0020-0190(82)90095-3
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Hoare's logic and Peano's arithmeticTheoretical Computer Science, 1983
- Some natural structures which fail to possess a sound and decidable hoare-like logic for their while-programsTheoretical Computer Science, 1982
- Expressiveness and the completeness of Hoare's logicJournal of Computer and System Sciences, 1982
- Floyd's principle, correctness theories and program equivalenceTheoretical Computer Science, 1982
- Ten Years of Hoare's Logic: A Survey—Part IACM Transactions on Programming Languages and Systems, 1981
- Soundness and Completeness of an Axiom System for Program VerificationSIAM Journal on Computing, 1978
- An axiomatic basis for computer programmingCommunications of the ACM, 1969