Heap Overruns – 2002 Edition

• The head is allocated in one contiguous block.

• Management of the individual allocation blocks is done with a data structure.

  • Usually a balanced or a 2/3 tree.
  • The pointers for that data structure are maintained in the same area as the heap.

• Writing past the end of a buffer change this structure.