A Complete and Consistent Hoare Axiomatics for a Simple Programming Language

DOI10.1145/322108.322120MaRDI QIDQ4170194zbMATH OpenOpenAlexFDO

Authors John C. Cherniavsky, Samuel Kamin

Publication date 1979

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322108.322120

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms in computer science (68W99)

Cited in

(7)

• Some simplified undecidable and NP-hard problems for simple programs
• Hierarchical development of programming languages
• Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
• On the zero-inequivalence problem for loop programs
• Program invariants as fixedpoints
• Semantics of algorithmic languages
• Simple programming languages and restricted classes of Turing machines

This page was built for publication: A Complete and Consistent Hoare Axiomatics for a Simple Programming Language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170194)