TY  - JOUR
A1  - Dang, Han-Hing
A1  - Möller, Bernhard
T1  - Transitive separation logic
T2  - Lecture Notes in Computer Science
N2  - Separation logic (SL) is an extension of Hoare logic by operations and formulas that not only talk about program variables, but also about heap portions. Its general purpose is to enable more exible reasoning 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 heap separation make assumptions about the linking structure. Phenomena to be treated comprise reachability analysis, (absence of) sharing, cycle detection, preservation of substructures under destructive assignments. We demonstrate the practicality of this approach with the examples of in-place list-reversal and tree rotation.
Y1  - 2012
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/58757
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-587577
SN  - 9783642333132
SN  - 9783642333149
SN  - 0302-9743
SN  - 1611-3349
VL  - 7560
SP  - 1
EP  - 16
PB  - Springer
CY  - Berlin
ER  -