Is “sometime” sometimes better than “always”?
- 1 February 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 21 (2), 159-172
- https://doi.org/10.1145/359340.359353
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Subgoal inductionCommunications of the ACM, 1977
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- An axiomatic basis for proving total correctness of goto-programsBIT Numerical Mathematics, 1976
- Correctness-preserving program transformationsPublished by Association for Computing Machinery (ACM) ,1975
- A closer look at terminationActa Informatica, 1975
- A view of program verificationPublished by Association for Computing Machinery (ACM) ,1975
- Structured Programming with go to StatementsACM Computing Surveys, 1974
- Mathematical theory of partial correctnessJournal of Computer and System Sciences, 1971
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967