Abstract
Based on the algebra of relations and maps we present some techniques for safe manipulation of pointer structures, with a special emphasis on tree-like structures. We investigate sufficient criteria for preservation of substructures under selective updating. The approach is illustrated with some simple examples.
Chapter PDF
References
U. Berger, W. Meixner, B. Möller: Calculating a garbage collector. In: M. Broy, M. Wirsing (eds.): Methods of programming. Lecture Notes in Computer Science 544. Berlin: Springer 1991, 137–192
R. Bird: Functional algorithm design. Science of Computer Programming 26, 15–31 (1996)
R.S. Bird, O. de Moor: Algebra of programming. Prentice-Hall 1996
W. Dosch, B. Möller: Calculating a functional module for binary search trees. In: W. Kluge (ed.): Proceedings of the 8th International Workshop on Implementation of Functional Languages, Bonn, Sept. 16–18, 1996. Lecture Notes in Computer Science. Berlin: Springer (to appear). Preliminary version accessible through http://www.math.uni-augsburg.de/-moeller
E.C.R. Hehner: A practical theory of programming. Berlin: Springer 1993
C.A.R. Hoare: Proofs of correctness of data representations. Acta Informatics 1, 271–281 (1972)
E.Meijer, M.Fokkinga, R. Paterson: Functional programming with bananas, lenses, envelopes and barbed wire. In: J. Hughes (ed.): Functional programming and computer architecture. Lecture Notes in Computer Science 523. Berlin: Springer 1991, 124–144
B. Möller: Formal derivation of pointer algorithms. In: M. Broy (Hrsg.): Informatik and Mathematik. Berlin: Springer 1991, 419–440
B. Möller: Development of graph and pointer algorithms. In: B. Möller, H.A. Partsch, S.A. Schuman (eds.): Formal program development. Lecture Notes in Computer Science 755. Berlin: Springer 1993, 123–160
B. Möller: Towards pointer algebra. Science of Computer Programming 21, 57–90 (1993) B. Möller: Linked lists calculated. Submitted for publication (1997)
P. Pepper, B. Möller: Programming with (finite) mappings. In: M. Broy (ed.): Informatik and Mathematik. Berlin: Springer 1991, 381–405
G. Schmidt, T. Ströhlein: Relations and graphs. Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoretical Computer Science. Berlin: Springer 1993
J.M. Spivey: The Z notation, 2nd edition. New York: Prentice-Hall 1994
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 IFIP
About this chapter
Cite this chapter
Möller, B. (1997). Calculating With Pointer Structures. In: Bird, R.S., Meertens, L. (eds) Algorithmic Languages and Calculi. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35264-0_2
Download citation
DOI: https://doi.org/10.1007/978-0-387-35264-0_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2877-3
Online ISBN: 978-0-387-35264-0
eBook Packages: Springer Book Archive