TY  - JOUR
A1  - Dang, Han Hing
A1  - Möller, Bernhard
T1  - Extended transitive separation logic
T2  - Journal of Logical and Algebraic Methods in Programming
N2  - Separation logic (SL) is an extension of Hoare logic by operations and formulas to reason more flexibly about heap portions or, more concretely, about linked object/record structures. In the present paper we give an algebraic extension of SL at the data structure level. We define operations that, additionally to guaranteeing heap separation, make assumptions about the linking structure. Phenomena to be treated comprise reachability analysis, (absence of) sharing, cycle detection and preservation of substructures under destructive assignments. We demonstrate the practicality of this approach with examples of in-place list-reversal, tree rotation and threaded trees.
Y1  - 2015
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/39443
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-394437
SN  - 2352-2208
VL  - 84
IS  - 3
SP  - 303
EP  - 325
PB  - Elsevier BV
ER  -