article

Free access

Analysis of pointer “rotation”

Author:

Norihisa SuzukiAuthors Info & Claims

Communications of the ACM, Volume 25, Issue 5

Pages 330 - 335

https://doi.org/10.1145/358506.358513

Published: 01 May 1982 Publication History

PDF eReader

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.

References

[1]

Deutsch, L.P., and Bobrow, D.G. An efficient, incremental, automatic garbage collector. Comm. ACM 19, 9 (Sept. 1976), 522- 526.

Digital Library

Google Scholar

[2]

Dijkstra, E.W. A Discipline of Programming, Prentice-Hall, Engelwood Cliffs, N J, 1976.

Digital Library

Google Scholar

[3]

Gries, D. The multiple assignment statement. IEEE Trans. on Software Eng. SE-4, 2(March 1978), 89-93.

Digital Library

Google Scholar

[4]

Jensen, K., and Wirth, N. PASCAL User Manual and Report, Springer-Verlag, New York, 1978.

Digital Library

Google Scholar

[5]

Robson, J.M. A bounded storage algorithm for copying cyclic structures. Comm. A CM 20, 6 (June 1977), 431-433.

Digital Library

Google Scholar

[6]

Schorr, H., and Waite, W.M. An efficient machine-independent procedure for garbage collection in various list structures. Comm. ACM 10, 8 (Aug. 1967), 501-506.

Digital Library

Google Scholar

Cited By

View all

Boldi PMarino ASantini MVigna S(2018)BUbiNGACM Transactions on the Web10.1145/316001712:2(1-26)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1145/3160017
Cacheda FBlanco RBarbieri N(2018)Characterizing and Predicting Users’ Behavior on Local Search QueriesACM Transactions on the Web10.1145/315705912:2(1-32)Online publication date: 27-May-2018
https://dl.acm.org/doi/10.1145/3157059
Padhy PDash RMartinez KJennings N(2010)A utility-based adaptive sensing and multihop communication protocol for wireless sensor networksACM Transactions on Sensor Networks10.1145/1754414.17544236:3(1-39)Online publication date: 24-Jun-2010
https://dl.acm.org/doi/10.1145/1754414.1754423
Show More Cited By

Index Terms

Analysis of pointer “rotation”

Recommendations

Analysis of pointer rotation
POPL '80: Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pointer manipulation is one of the trickiest operations in programming and is a major source of programming errors. A great deal of research effort has been dedicated to making programs with pointers more reliable. In this paper we will present pointer ...
Interprocedural pointer alias analysis

We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...
Practical pointer aliasing analysis

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 25, Issue 5

May 1982

32 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/358506

Editor:
Robert L. Ashenhurst
Univ. of Chicago, Chicago, IL

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1982

Published in CACM Volume 25, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
447
Total Downloads

Downloads (Last 12 months)75
Downloads (Last 6 weeks)6

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Boldi PMarino ASantini MVigna S(2018)BUbiNGACM Transactions on the Web10.1145/316001712:2(1-26)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1145/3160017
Cacheda FBlanco RBarbieri N(2018)Characterizing and Predicting Users’ Behavior on Local Search QueriesACM Transactions on the Web10.1145/315705912:2(1-32)Online publication date: 27-May-2018
https://dl.acm.org/doi/10.1145/3157059
Padhy PDash RMartinez KJennings N(2010)A utility-based adaptive sensing and multihop communication protocol for wireless sensor networksACM Transactions on Sensor Networks10.1145/1754414.17544236:3(1-39)Online publication date: 24-Jun-2010
https://dl.acm.org/doi/10.1145/1754414.1754423
Lee HKeshavarzian AAghajan H(2010)Near-lifetime-optimal data collection in wireless sensor networks via spatio-temporal load balancingACM Transactions on Sensor Networks10.1145/1754414.17544226:3(1-32)Online publication date: 24-Jun-2010
https://dl.acm.org/doi/10.1145/1754414.1754422
Möller B(2005)Derivation of graph and pointer algorithmsFormal Program Development10.1007/3-540-57499-9_19(123-160)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-57499-9_19
Hoare CJifeng H(2003)A trace model for pointers and objectsProgramming methodology10.5555/766951.766963(223-245)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.5555/766951.766963
Meyer B(2003)Towards practical proofs of class correctnessProceedings of the 3rd international conference on Formal specification and development in Z and B10.5555/1761968.1761990(359-387)Online publication date: 4-Jun-2003
https://dl.acm.org/doi/10.5555/1761968.1761990
Hoare CJifeng H(2003)A trace model for pointers and objectsProgramming Methodology10.1007/978-0-387-21798-7_11(223-245)Online publication date: 2003
https://doi.org/10.1007/978-0-387-21798-7_11
Meyer B(2003)Towards Practical Proofs of Class CorrectnessZB 2003: Formal Specification and Development in Z and B10.1007/3-540-44880-2_22(359-387)Online publication date: 27-May-2003
https://doi.org/10.1007/3-540-44880-2_22
Hoare CJifeng H(1999)A Trace Model for Pointers and ObjectsECOOP’ 99 — Object-Oriented Programming10.1007/3-540-48743-3_1(1-18)Online publication date: 19-Nov-1999
https://doi.org/10.1007/3-540-48743-3_1
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations