Proving programs correct: Some techniques and examples
- 1 June 1970
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 10 (2) , 168-182
- https://doi.org/10.1007/bf01936865
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Computer Interval Arithmetic: Definition and Proof of Correct ImplementationJournal of the ACM, 1970
- Certification of algorithm 245 [M1]:treesort 3:proof of algorithms—a new kind of certificationCommunications of the ACM, 1970
- Computer Programs can be Proved CorrectPublished by Springer Nature ,1970
- A proof of Hamblin's algorithm for translation of arithmetic expressions from infix to postfix formBIT Numerical Mathematics, 1969
- A constructive approach to the problem of program correctnessBIT Numerical Mathematics, 1968
- The structure of the “THE”-multiprogramming systemCommunications of the ACM, 1968
- Correctness of a compiler for arithmetic expressionsProceedings of Symposia in Applied Mathematics, 1967
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967
- Proof of algorithms by general snapshotsBIT Numerical Mathematics, 1966