Calculational Derivation of Algorithms on Tree-based Pointer Structures

We describe an approach to the derivation of correct algorithms on tree-based pointer structures. The approach is based on identifying abstract representations of commonly used pointer manipulations on trees and providing calculational-style refinement rules for these manipulations. This allows the algorithmic structure of a program to be derived using abstract data representations before introducing pointer structures.

Content

Author and article information

Contributors

Michael Butler

Conference

Publication date: July 1996

Publication date (Print): July 1996

Pages: 1-20

Affiliations

[0001]Dept. of Electronics & Computer Science, Univ. of Southampton,

Southampton SO17 1BJ, United Kingdom

Article

DOI: 10.14236/ewic/RW1996.2

SO-VID: b1eda991-ef1f-4ed5-b515-3246dc4e1229

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Proceedings of the BCS-FACS 7th Refinement Workshop

Conference acronym: RW

Conference number: 7

Conference location: Bath

Conference date: 3-5 July 1996

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: BCS-FACS 7th Refinement Workshop

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/RW1996.2

Self URI (journal page): https://ewic.bcs.org/

Celebrating 65 years of The Computer Journal - free-to-read perspectives - bcs.org/tcj65

Calculational Derivation of Algorithms on Tree-based Pointer Structures

Abstract