TY  - CHAP
A1  - Möller, Bernhard
A2  - Broy, Manfred
T1  - Some applications of pointer algebra
T2  - Programming and mathematical method: international summer school; [proceedings of the NATO Advanced Study Institute on Programming and Mathematical Method, held at Marktoberdorf, FRG, July 24 - August 5, 1990]
N2  - It is well-known that algorithms involving pointers are both difficult to write and to verify. One reason is that, due to the implict connections through paths within a pointer structure, the side effects of a pointer assignment are usually much harder to survey than those of an ordinary assignment. Second, a careless assignment may destroy the last link to a substructure which thus is lost forever. Now, not only is it easy to make such errors; it is also very hard to find them. With this paper we want to show that these diffculties can be greatly reduced by making the store, which is an implicit global parameter in procedural languages, into an explicit parameter and by passing to an applicative treatment using a suitable algebra of operations on the store.
Y1  - 1992
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/18050
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-180504
SN  - 3-540-55558-7
SN  - 0-387-55558-7
SP  - 123
EP  - 155
PB  - Springer
CY  - Berlin [u.a.]
ER  -