In this paper, we present a Hoare-style logic for specifying and verifying how two pointer programs are related. Our logic lifts the main features of separation logic, from an assertion to a relation, and from a property about a single program to a relationship between two programs. We show the strength of the logic, by proving that the Schorr-Waite graph marking algorithm is equivalent to the depth-first traversal.
Yang REF defines Relational Separation Logic and proves the equivalence between Depth-First Search and the Schorr-Waite algorithm.
Relational separation logic
Theor. Comput. Sci.
Theor. Comput. Sci.
Computer Science