In this paper, a shape-analysis based approach is proposed to automatically identify aggregations that are implemented using the commonly used implementation mechanism, pointers or references. First, this paper augments predicates of Sagiv’s three-valued logical structure to describe the semantic constraints for the central aggregation management operations on linked lists. Then, this paper presents a method to identify the aggregation management behavior by analyzing the changes of shape structures for linked lists along control flow paths. Finally, the effectiveness of the proposed 1-n aggregation identification approach is proposed using a case study from the open-source software JEdit.