A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
- 1 January 1979
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 26 (1) , 119-128
- https://doi.org/10.1145/322108.322120
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Even Simple Programs Are Hard To AnalyzeJournal of the ACM, 1977
- Programming language constructs for which it is impossible to obtain good hoare-like axiom systemsPublished by Association for Computing Machinery (ACM) ,1977
- An axiomatic definition of the programming language PASCALActa Informatica, 1973
- Subrecursive Programming Languages, Part IJournal of the ACM, 1972
- The complexity of loop programsPublished by Association for Computing Machinery (ACM) ,1967