Proof of termination within a weak logic of programs
- 1 March 1977
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 8 (1), 21-36
- https://doi.org/10.1007/bf00276182
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Automatic Program Verification 4: Proof of Termination within a Weak Logic of ProgramsPublished by Defense Technical Information Center (DTIC) ,1975
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975
- Verifying programs by algebraic and logical reductionACM SIGPLAN Notices, 1975
- A methodology for verifying programsACM SIGPLAN Notices, 1975
- Automatic program verification I: A logical basis and its implementationActa Informatica, 1975
- An axiomatic definition of the programming language PASCALActa Informatica, 1973
- Program proving: CoroutinesActa Informatica, 1973
- Procedures and parameters: An axiomatic approachLecture Notes in Mathematics, 1971
- An axiomatic basis for computer programmingCommunications of the ACM, 1969