A Hoare Logic for Diverging Programs

Johannes Åman Pohjola 📧, Magnus O. Myreen 📧 and Miki Tanaka 📧

January 20, 2023

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

Abstract

This submission contains:
  1. a formalisation of a small While language with support for output;
  2. a standard total-correctness Hoare logic that has been proved sound and complete; and
  3. a new Hoare logic for proofs about programs that diverge: this new logic has also been proved sound and complete.

License

BSD License

Topics

Related publications

  • Åman Pohjola, J., Rostedt, H., & Myreen, M. O. (2019). Characteristic Formulae for Liveness Properties of Non-Terminating CakeML Programs (Version 1.0). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITP.2019.32

Session HoareForDivergence

Depends on

Cite

× 
@article{HoareForDivergence-AFP,
  author  = {Johannes Åman Pohjola and Magnus O. Myreen and Miki Tanaka},
  title   = {A Hoare Logic for Diverging Programs},
  journal = {Archive of Formal Proofs},
  month   = {January},
  year    = {2023},
  note    = {\url{https://isa-afp.org/entries/HoareForDivergence.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: