Transformational Construction of Correct Pointer Algorithms

Authors:
Thorsten Ehm
Affiliations:
-
Venue:
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Year:
2001

Citing 11
Cited 0

Calculating with pointers

Science of Computer Programming
Specification and transformation of programs: a formal approach to software development

Specification and transformation of programs: a formal approach to software development
Towards pointer algebra

Science of Computer Programming
Calculating with pointer structures

Proceedings of the IFIP TC 2 WG 2.1 international workshop on Algorithmic languages and calculi
Calculational derivation of pointer algorithms from tree operations

Science of Computer Programming
Calculating with acyclic and cyclic lists

Information Sciences: an International Journal - Relational methods in computer science
Algorithmic Language and Program Development

Algorithmic Language and Program Development
Introduction to Functional Programming

Introduction to Functional Programming
Proving Pointer Programs in Hoare Logic

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
FUNCTIONAL PEARL: Unfolding pointer algorithms

Journal of Functional Programming
Comparative schematology

Record of the Project MAC conference on concurrent systems and parallel computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows how to use the transformation of Paterson and Hewitt to improve the memory and operations used in a pointer algorithm. That transformation scheme normally is only of theoretical interest because of the inefficient performance of the transformed function. However we present a method how it can be used to decrease the amount of selective updates in memory while preserving the original runtime performance. This leads to a general transformation framework for the derivation of a class of pointer algorithms.