A complete and consistent hoare axiomatics for a simple programming language

Authors:
J. Cherniavsky;S. Kamin
Affiliations:
SUNY at Stony Brook, N.Y.;SUNY at Stony Brook, N.Y.
Venue:
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1977

Citing 4
Cited 0

Introduction to mathematical logic (3rd ed.)

Introduction to mathematical logic (3rd ed.)
Subrecursive Programming Languages, Part I: efficiency and program structure

Journal of the ACM (JACM)
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
The complexity of loop programs

ACM '67 Proceedings of the 1967 22nd national conference

Quantified Score

Hi-index	0.00

Visualization

Abstract