A bounded storage algorithm for copying cyclic structures
Communications of the ACM
An efficient, incremental, automatic garbage collector
Communications of the ACM
An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM
A Discipline of Programming
PASCAL user manual and report
Copying and Swapping: Influences on the Design of Reusable Software Components
IEEE Transactions on Software Engineering
Lively linear Lisp: “look ma, no garbage!”
ACM SIGPLAN Notices
ACM SIGPLAN Notices
Thermodynamics and garbage collection
ACM SIGPLAN Notices
Linear logic and permutation stacks—the Forth shall be first
ACM SIGARCH Computer Architecture News - Special issue: panel sessions of the 1991 workshop on multithreaded computers
One-bit counts between unique and sticky
Proceedings of the 1st international symposium on Memory management
A Trace Model for Pointers and Objects
ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
A trace model for pointers and objects
Programming methodology
Containment defines a class of recursive data structures
ACM SIGPLAN Notices
Towards practical proofs of class correctness
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
| Hi-index | 48.22 |
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.