Computer science Semantics and logic in computer science Concept
Separation logic
Builds on Hoare logic
Summary
Separation logic is an extension of Hoare logic for reasoning about programs that use pointers and mutable memory. It was developed around 2000 by John C. Reynolds, Peter O'Hearn, Samin Ishtiaq and Hongseok Yang. Its key connective is the separating conjunction , which says that memory splits into two disjoint parts, one satisfying and the other . The frame rule then extends a proof about the memory that a command touches to any larger memory. This makes proofs local and scalable.
Reading path
To understand this page from the ground up, read these 13 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Binary relation concept
- Proposition concept
- Operational semantics concept
- Conjunction definition
- Disjunction definition
- Implication definition
- Negation definition
- Predicate definition
- Biconditional definition
- Propositional logic concept
- Predicate logic concept
- Hoare logic concept
- Separation logic concept
Further reading
About this page
| Tag | CF5Y39BPB0 |
|---|---|
| URI | m2://CF5Y39BPB0 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68Q60, 03B70, 03B47 |
| Uses | Hoare logic |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.