Expressiveness and the completeness of Hoare's logic
- 1 December 1982
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 25 (3) , 267-284
- https://doi.org/10.1016/0022-0000(82)90013-7
Abstract
No abstract availableKeywords
This publication has 12 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
- Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and LauerACM Transactions on Programming Languages and Systems, 1981
- Corrigendum: Soundness and Completeness of an Axiom System for Program VerificationSIAM Journal on Computing, 1981
- Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom SystemsJournal of the ACM, 1979
- A New Incompleteness Result for Hoare's SystemJournal of the ACM, 1978
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- CONSTRUCTIVE ALGEBRAS IRussian Mathematical Surveys, 1961