Abstract Hoare Logics

Tobias Nipkow

8 August 2006

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.
BSD License

Topics

Related Entries

Theories

Cite

×
@article{Abstract-Hoare-Logics-AFP,
  author  = {Tobias Nipkow},
  title   = {Abstract Hoare Logics},
  journal = {Archive of Formal Proofs},
  month   = August,
  year    = 2006,
  note    = {\url{http://isa-afp.org/entries/Abstract-Hoare-Logics.html},
            Formal proof development},
  ISSN    = {2150-914x},
}
Download