On locality and the exchange law for concurrent processes

Authors:
C. A. R. Hoare;Akbar Hussain;Bernhard Möller;Peter W. O'Hearn;Rasmus Lerchedahl Petersen;Georg Struth
Affiliations:
Microsoft Research Cambridge;Queen Mary University of London;Universität Augsburg;Queen Mary University of London;Queen Mary University of London;University of Sheffield
Venue:
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Year:
2011

Citing 8
Cited 7

The equational theory of pomsets

Theoretical Computer Science
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Free shuffle algebras in language varieties

Theoretical Computer Science
A Discipline of Programming

A Discipline of Programming
A Semantic Basis for Local Reasoning

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A semantics for concurrent separation logic

Theoretical Computer Science
Resources, concurrency, and local reasoning

Theoretical Computer Science
Local Action and Abstract Separation Logic

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science

Algebra, logic, locality, concurrency

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Algebra, logic, locality, concurrency

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Unification modulo synchronous distributivity

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
The laws of programming unify process calculi

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Reverse exchange for concurrency and local reasoning

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Transitive separation logic

RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Generic models of the laws of programming

Theories of Programming and Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.