Hoare Logics in Isabelle/HOL [chapter]

Tobias Nipkow
2002 Proof and System-Reliability  
This paper describes Hoare logics for a number of imperative language constructs, from while-loops via exceptions to mutually recursive procedures. Both partial and total correctness are treated. In particular a proof system for total correctness of recursive procedures in the presence of unbounded nondeterminism is presented. All systems are formalized and shown to be sound and complete in the theorem prover Isabelle/HOL. notes.tex; 21/11/2001; 15:49; p.1 notes.tex; 21/11/2001; 15:49; p.2
doi:10.1007/978-94-010-0413-8_11 fatcat:dv4rbwf7yjevxmxn6gsqjzpita