Hoare's logic and Peano's arithmetic
- 1 February 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 22 (3) , 265-284
- https://doi.org/10.1016/0304-3975(83)90107-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Some natural structures which fail to possess a sound and decidable hoare-like logic for their while-programsTheoretical Computer Science, 1982
- Two theorems about the completeness of Hoare's logicInformation Processing Letters, 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
- Abstract Data Type Specification in the Affirm SystemIEEE Transactions on Software Engineering, 1980
- Verification of Array, Record, and Pointer Operations in PascalACM Transactions on Programming Languages and Systems, 1979
- Soundness and Completeness of an Axiom System for Program VerificationSIAM Journal on Computing, 1978
- A Mathematical Incompleteness in Peano ArithmeticPublished by Elsevier ,1977
- Automatic program verification I: A logical basis and its implementationActa Informatica, 1975
- An axiomatic basis for computer programmingCommunications of the ACM, 1969