In each memory location store the number of incoming pointers
Free the block if the counter is zero
What is the block has pointers itsefl?
- decrementing counts when the r is reused again
- ensures a bounded amount of work for each operation
Two problems of reference counting
- cost of field assignments = ?
- for which classes of graphs it works?
Data-flow analysis for avoiding reference count updates of local variables