Pointers and data abstractions in high level languages-II: Correctness proofs

Authors:
D. M. Berry
Affiliations:
Computer Science Department, University of California, Los Angeles, Los Angeles, CA 90024, U.S.A.
Venue:
Computer Languages
Year:
1977

Citing 6
Cited 0

Two PARALLEL EULER run time models: The dangling reference, impostor environment, and label problems

HLLCA '73 Proceedings of the ACM-IEEE symposium on High-level-language computer architecture
Block structure (Extended Abstract): Retention or deletion?

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Programming with abstract data types

Proceedings of the ACM SIGPLAN symposium on Very high level languages
Verifying programs which operate on data structures

Proceedings of the international conference on Reliable software
Revised Report of the Algorithmic Language Algol 68

ALGOL Bulletin
Modelling of storage properties of higher level languages

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recognizing the problems that the use of pointers pose to the construction of reliable software, this two-part paper proposes a scheme by which pointers may be used in a controlled manner to build data abstractions without being used as abstractions in their own right. Part I, published in Computer Languages2, 135-148, presents the language constructs facilitating the proposal. Part II, in this Issue, attempts to show, by use of a fairly complex example, that proving the correctness of an implementation of an abstraction built in this manner from pointers need not be more difficult than other implementation correctness proofs.