Some applications of pointer algebra

  • 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.

Download full text files

Export metadata


Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Author:Bernhard MöllerGND
Frontdoor URL
Parent Title (English):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]
Place of publication:Berlin [u.a.]
Editor:Manfred Broy
Type:Part of a Book
Year of first Publication:1992
Publishing Institution:Universität Augsburg
Release Date:2017/07/21
First Page:123
Last Page:155
Series:NATO ASI series: F, Computer and systems sciences; 88
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme
Dewey Decimal Classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Licence (German):Deutsches Urheberrecht