scientific article; zbMATH DE number 3688676
From MaRDI portal
Publication:3883459
Cited in
(8)- On termination problems for finitely interpreted ALGOL-like programs
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
- Fifty years of Hoare's logic
- Verification of object-oriented programs: a transformational approach
- Probabilistic predicate transformers. II: Partially observable probability
- Wythoff games, continued fractions, cedar trees and Fibonacci searches
- Correctness of programs with Pascal-like procedures without global variables
- Expressiveness and the completeness of Hoare's logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883459)