Calculational derivation of algorithms on tree-based pointer structures

Authors:
Michael Butler
Affiliations:
Dept. of Electronics & Computer Science, Univ. of Southampton, Southampton, United Kingdom
Venue:
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
Year:
1996

Citing 11
Cited 0

A theoretical basis for stepwise refinement and the programming calculus

Science of Computer Programming
Verification of programs that destructively manipulate data

Science of Computer Programming
Calculating with pointers

Science of Computer Programming
Data refinement of predicate transformers

Theoretical Computer Science
Towards pointer algebra

Science of Computer Programming
Normal form approach to compiler design

Acta Informatica
The lattice of data refinement

Acta Informatica
Programming from specifications (2nd ed.)

Programming from specifications (2nd ed.)
Verification of Array, Record, and Pointer Operations in Pascal

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Discipline of Programming

A Discipline of Programming
Exploring Summation and Product Operators in the Refinement Calculus

MPC '95 Mathematics of Program Construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.