Proving program inclusion using Hoare's logic
- 1 January 1984
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 30 (1) , 1-48
- https://doi.org/10.1016/0304-3975(84)90065-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Hoare's logic and Peano's arithmeticTheoretical Computer Science, 1983
- Expressiveness and the completeness of Hoare's logicJournal of Computer and System Sciences, 1982
- Two theorems about the completeness of Hoare's logicInformation Processing Letters, 1982
- Floyd's principle, correctness theories and program equivalenceTheoretical Computer Science, 1982
- Correctness of the compiling process based on axiomatic semanticsActa Informatica, 1980
- Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom SystemsJournal of the ACM, 1979
- Soundness and Completeness of an Axiom System for Program VerificationSIAM Journal on Computing, 1978
- Consistent and complementary formal theories of the semantics of programming languagesActa Informatica, 1974
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- How to Program an Infinite AbacusCanadian Mathematical Bulletin, 1961