TY  - JOUR
A1  - Dang, Han-Hing
A1  - Möller, Bernhard
T1  - Reverse exchange for concurrency and local reasoning
T2  - Lecture Notes in Computer Science
N2  - Recent research has pointed out the importance of the inequational exchange law (P*Q);(R*S) ≤ (P;R)*(Q;S) for concurrent processes. In particular, it has been shown that this law is equivalent to validity of the concurrency rule for Hoare triples. Unfortunately, the law does not hold in the relationally based setting of algebraic separation logic. However, we show that under mild conditions the reverse inequation (P;R)*(Q;S) ≤ (P*Q);(R*S) still holds there. Separating conjunction * in that calculus can be interpreted as true concurrency on disjointly accessed resources. From the reverse exchange law we derive slightly restricted but still reasonably useful variants of the concurrency rule. Moreover, using a corresponding definition of locality, we obtain also a variant of the frame rule. By this, the relational setting can also be applied for modular and concurrency reasoning. Finally, we present several variations of the approach to further interpret the results.
Y1  - 2012
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/58762
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-587629
SN  - 9783642311123
SN  - 9783642311130
SN  - 0302-9743
SN  - 1611-3349
VL  - 7342
SP  - 177
EP  - 197
PB  - Springer
CY  - Berlin
ER  -