On Locality and the Exchange Law for Concurrent Processes
This paper studies algebraic models for concurrency, in light of recent work on Concurrent Kleene Algebra and Separation Logic. It establishes a strong connection between the Concurrency and Frame Rules of Separation Logic and a variant of the exchange law of Category Theory. We investigate two standard models: one uses sets of traces, and the other is state-based, using assertions and weakest preconditions. We relate the latter to standard models of the heap as a partial function. We exploit the power of algebra to unify models and classify their variations.
KeywordsProgram Logic Complete Lattice Resource Model Local Element Concurrent Process
Unable to display preview. Download preview PDF.
- 2.Bloom, S.L., Ésik, Z.: Free shuffle algebras in language varieties. TCS 163(182), 55–98 (1996)Google Scholar
- 4.Calcagno, C., O’Hearn, P.W., Yang, H.: Local action and abstract separation logic. In: LICS, pp. 366–378. IEEE Computer Society, Los Alamitos (2007)Google Scholar
- 8.Hoare, T., Möller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra and its foundations. Journal of Logic and Algebraic Programming (2011); Prelim. version in CONCUR 2009Google Scholar
- 10.O’Hearn, P.W.: Resources, concurrency and local reasoning. TCS 375(1-3), 271–307 (2004); Prelim. version appeared in CONCUR 2004Google Scholar