A New Incompleteness Result for Hoare's System
From MaRDI portal
Publication:4139636
DOI10.1145/322047.322062zbMATH Open0364.68008OpenAlexW1994586366MaRDI QIDQ4139636FDOQ4139636
Authors: Mitchell Wand 
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322047.322062
Cited In (21)
- On the completeness of modular proof systems
- Some general incompleteness results for partial correctness logics
- Recursive assertions are not enough - or are they?
- Semantical analysis of specification logic
- Title not available (Why is that?)
- Fifty years of Hoare's logic
- Expressiveness and the completeness of Hoare's logic
- Proof methods of declarative properties of definite programs
- Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
- Current methods for proving program correctness
- Average case optimality for linear problems
- Generating algebraic laws from imperative programs
- On the mechanical derivation of loop invariants
- A language independent proof of the soundness and completeness of generalized Hoare logic
- A mechanical analysis of program verification strategies
- Proving program inclusion using Hoare's logic
- Weakly expressive models for Hoare logic
- The semantics of Hoare's iteration rule
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
- A methodology for designing proof rules for fair parallel programs
- Some questions about expressiveness and relative completeness in Hoare's logic
This page was built for publication: A New Incompleteness Result for Hoare's System
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4139636)
