Sepviz Tutorial (Part 1): Heap Predicates as Memory Diagrams
Welcome to Part 1 of the Sepviz tutorial! Discover how our separation-logic visualization tool turns heap predicates into intuitive heap-memory diagrams.
Separation-logic proofs of heap-manipulating programs require careful accounting of objects and pointers in memory. On paper, these proofs are often accompanied by heap-memory diagrams that help authors and readers track the evolution of the program’s abstract state. However, users of interactive theorem provers must instead work with plain-text notations that obscure object relationships.
In Sepviz, we imitate an intuitive diagrammatic notation commonly used in research and educational materials about separation logic, support animation across proof steps, and make it easy to port to new frameworks.