Program proving: KJumps and functions
From MaRDI portal
Cites work
Cited in
(21)- Hierarchical program specification and verification - a many-sorted logical approach
- Continuations in possible-world semantics
- Axiomatic semantics for escape statements
- Axiomatic approach to side effects and general jumps
- Remarks on 'Program proving: Jumps and functions' by M. Clint and C.A.R. Hoare
- The use of Hoare's method of program verification for the Quicksort algorithm
- Automatic program verification. I: A logical basis and its implementation
- Fifty years of Hoare's logic
- Weakest preconditioned goto axiom
- On algebra of program correctness and incorrectness
- scientific article; zbMATH DE number 3688675 (Why is no real title available?)
- Current methods for proving program correctness
- An axiomatic basis for proving total correctness of goto-programs
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
- Hoare-style logic for unstructured programs
- On verification of programs with goto statements
- A complete axiomatic semantics of spawning
- A compositional natural semantics and Hoare logic for low-level languages
- Semantical analysis of specification logic
- Proof theory for exception handling in a tasking environment
- A mechanical analysis of program verification strategies
This page was built for publication: Program proving: KJumps and functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2550288)