Affiliation:
1. Xerox Palo Alto Research Center, Palo Alto, CA
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.
Publisher
Association for Computing Machinery (ACM)
Reference6 articles.
1. An efficient, incremental, automatic garbage collector
2. Dijkstra E.W. A Discipline of Programming Prentice-Hall Engelwood Cliffs N J 1976. Dijkstra E.W. A Discipline of Programming Prentice-Hall Engelwood Cliffs N J 1976.
3. The Multiple Assignment Statement
4. A bounded storage algorithm for copying cyclic structures
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A trace model for pointers and objects;Monographs in Computer Science;2003
2. Towards Practical Proofs of Class Correctness;ZB 2003: Formal Specification and Development in Z and B;2003
3. One-bit counts between unique and sticky;ACM SIGPLAN Notices;1999-03
4. A Trace Model for Pointers and Objects;ECOOP’ 99 — Object-Oriented Programming;1999
5. Implementing (nondeterministic) parallel assignments;Information Processing Letters;1996-05