2017-03-02: Bob Atkey (MSP)

Sat, 21 Oct 2023 21:24:08 +0100

Bob Atkey (MSP)

MSP 101: Separation Logic and Hoare Logic

Abstract

Hoare Logic is a logic for proving properties of programs of the form: if the initial state satisfies a precondition, then the final state satisfies a postcondition. Hoare logic proofs are structured around the structure of the program itself, making the system a compositional one for reasoning about pieces of programs. I'll introduce Hoare Logic for a little imperative language with WHILE loops. I'll then motivate Separation Logic, which enriches Hoare Logic with a Frame Rule for local reasoning.

2017-03-02 14:00:00 UTC
LT1310