Relative completness of Hoare logic
Go to file
Dan Frumin 0c55194a2f cleanup 2019-06-12 17:52:53 +02:00
Hoare.v cleanup 2019-06-12 17:52:53 +02:00
ImpSimpl.v cleanup 2019-06-12 17:52:53 +02:00
Makefile cleanup 2019-06-12 17:52:53 +02:00
README cleanup 2019-06-12 17:52:53 +02:00

README

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