This artice is free to access.
Heap entities tend to contain complex references to each other. To manage this complexity, types which express shapes and hierarchies have been suggested. We survey type systems which describe such hierarchic shapes, how these types are used for reasoning about programs, and applications in concurrent programming. © Springer-Verlag Berlin Heidelberg 2006.
Drossopoulou, S., Clarke, D., & Noble, J. (2006). Types for hierarchic shapes (summary). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3924 LNCS, pp. 1–6). https://doi.org/10.1007/11693024_1