hoare-completeness/README

7 lines
296 B
Plaintext
Raw Normal View History

2019-06-12 17:52:53 +02:00
A simple formulation of Hoare logic for a WHILE-language, with a proof of /relative completeness/:
If a triple { P } s { Q } is valid in the model, then it is derivable
using the rules in Hoare.v (see the inductive type `hoare_triple`).
Requires std++: <https://gitlab.mpi-sws.org/iris/stdpp>.