Correctness of programs with Pascal-like procedures without global variables
Open Access
- 31 December 1984
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 30 (1) , 49-90
- https://doi.org/10.1016/0304-3975(84)90066-5
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the notion of expressiveness and the rule of adaptationTheoretical Computer Science, 1983
- Effective Axiomatizations of Hoare LogicsJournal of the ACM, 1983
- The IO- and OI-hierarchiesTheoretical Computer Science, 1982
- On termination problems for finitely interpreted ALGOL-like programsActa Informatica, 1982
- Ten Years of Hoare's Logic: A Survey—Part IACM Transactions on Programming Languages and Systems, 1981
- The formal termination problem for programs with finite ALGOL 68-modesInformation Processing Letters, 1979
- 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
- Generic commands--a tool for partial correctness formalismsThe Computer Journal, 1977
- An axiomatic basis for computer programmingCommunications of the ACM, 1969