2026-09-20T18:01:27Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/19122 2023-07-10 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Harrison, Williams Ludwell, III, Tsai, Mei-Chin 2011-05-07T11:57:37Z 2011-05-07T11:57:37Z 10000-01-01 1994 In this thesis, we categorize linked structures and linked substructures each into four groups based on two attributes, sharing and cycles. We show that these two attributes can be determined at compile-time by augmenting any store-based analysis with heap reference counts and the missing link property. An analysis, which has the form of an abstract interpretation, is defined and implemented with the program generator Z1. The language analyzed is a low-level intermediate form in which there is no user-level type information. This fact makes the analysis applicable to languages like C and C++, for which type casting and type violations are frequent. A set of programs that create and manipulate linked structures is analyzed. The results show that the analysis is able to correctly recognize a variety of linked data structures, such as radix trees and binary search trees, and substructures, such as those defined by down and next pointer fields in meshes. Made available in DSpace on 2011-05-07T11:57:37Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9512576.pdf: 4543311 bytes, checksum: 74c2a0f295ccf031c36f68c160716952 (MD5) Previous issue date: 1994 Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:34:48Z Item is restricted indefinitely. Restriction data tranferred 2014-07-01T11:13:28-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission ETDs are only available to UIUC Users without author permission U of I Only AAI9512576 (UMI)AAI9512576 http://hdl.handle.net/2142/19122 eng Copyright 1994 Tsai, Mei-Chin Computer Science Categorization and analyzing linked structures text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.