An axiomatic basis for proving total correctness of goto-programs
From MaRDI portal
Publication:4082983
DOI10.1007/BF01940782zbMath0321.68010MaRDI QIDQ4082983
Publication date: 1976
Published in: BIT (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic, An axiomatic basis for proving total correctness of goto-programs, Axiomatic proofs of total correctness of programs, Semantics of algorithmic languages, Current methods for proving program correctness, Verifying programs by induction on their data structure: general format and applications
Cites Work