Graphical models of separation logic

@article{Wehrman2009GraphicalMO,
  title={Graphical models of separation logic},
  author={Ian Wehrman and C. A. R. Hoare and Peter W. O'Hearn},
  journal={Inf. Process. Lett.},
  year={2009},
  volume={109},
  pages={1001-1004}
}
Labelled graphs are used to model control and data flow among events occurring in the execution of a (possibly concurrent) program. Data flow is a unifying concept that covers both access to memory and communication along channels; it covers many variations including weakly consistent memory, re-ordered execution, and communication channels that are multiplexed, buffered, or otherwise unreliable. Nevertheless, the laws of Hoare and Jones correctness reasoning remain valid when interpreted in… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS