Visibility aspects of programmed dynamic data structures

  • Authors:
  • Nazim H. Madhavji

  • Affiliations:
  • McGill Univ., Montreal, P.Q., Canada

  • Venue:
  • Communications of the ACM
  • Year:
  • 1984

Quantified Score

Hi-index 48.22

Visualization

Abstract

Unlike static structures, dynamic Pascal-like data structures often suffer visibility problems due to the unrestricted use of the general pointer mechanism. By classifying these structures and identifying the different kinds of pointers, a methodology is proposed for achieving improved visibility.