Abstract Hoare Logics

Tobias Nipkow 🌐

August 8, 2006

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


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.


BSD License


Related publications

Session Abstract-Hoare-Logics