Analysis of pointer “rotation”
- 1 May 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 25 (5), 330-335
- https://doi.org/10.1145/358506.358513
Abstract
Two high-level pointer operations, rotation and slide, reduce conceptual difficulties when writing pointer programs and increase the reliability of programs. We analyze theoretically as well as empirically why these operations are more convenient and introduce a mechanically checkable notion of the safety of rotations. Several examples show that safety is a good indication of program correctness. Examples of list marking and list copying programs demonstrate the utility of these operations.Keywords
This publication has 4 references indexed in Scilit:
- The Multiple Assignment StatementIEEE Transactions on Software Engineering, 1978
- A bounded storage algorithm for copying cyclic structuresCommunications of the ACM, 1977
- An efficient, incremental, automatic garbage collectorCommunications of the ACM, 1976
- An efficient machine-independent procedure for garbage collection in various list structuresCommunications of the ACM, 1967