A Complete and Consistent Hoare Axiomatics for a Simple Programming Language

Authors:
John C. Cherniavsky;Samuel N. Kamin
Affiliations:
Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY;Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY
Venue:
Journal of the ACM (JACM)
Year:
1979

Citing 6
Cited 2

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)
Even Simple Programs Are Hard To Analyze

Journal of the ACM (JACM)
Programming language constructs for which it is impossible to obtain good hoare-like axiom systems

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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

Decidable problems for powerful programs

Journal of the ACM (JACM)
The Complexity of the Equivalence Problem for Simple Programs

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract