Separation Logic Acknowledgment: slides taken from Reynolds’ mini-course CS 818A3

Extending Imp with Memory Accesses

Note that expressions depend only on the store

Note the abort here is different from the abort for “fault”

Operational Semantics Dispose left as assignment

Assertions Standard predicate logic assertions, plus

Axiom Schemata for Purity

Strictly Exact Assertions (Yang) An assertion is strictly exact iff, for all stores s and all heaps h and h', Examples:

Precise Assertions An assertion q is precise iff, for all s and h, there is at most one h'  h such that Examples:

Preciseness and Distributivity

Proposition: The following is valid when q is precise:

Intuitionistic Assertions An assertion i is intuitionistic iff, for all stores s and heaps h and h': Special cases: