Abstract Hoare Logics

 

Title:	Abstract Hoare Logics
Author:	Tobias Nipkow
Submission date:	2006-08-08
Abstract:	These therories describe Hoare logics for a number of imperative language constructs, from while-loops 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.
Status: [ok]	This is the development version of this entry generated for Isabelle-25-Dec-2009. The development version might change over time and is only permanently archived at Isabelle release points. It is provided as a preview of the next upcoming release. Please refer to release versions only in citations. If the status shows [FAIL], the links below will point to the last working version if any.

 

Proof outline Proof document

Browse theories

Download this entry

Older releases: Isabelle 2009: afp-Abstract-Hoare-Logics-2009-04-29.tar.gz Isabelle 2008: afp-Abstract-Hoare-Logics-2008-06-10.tar.gz Isabelle 2007: afp-Abstract-Hoare-Logics-2007-11-27.tar.gz