Categorization and analyzing linked structures

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.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Tsai, Mei-Chin

Contributors dc:contributor

• Harrison, Williams Ludwell, III,

• Computer Science

Statement dc:rights

• Copyright 1994 Tsai, Mei-Chin

Language dc:language

eng

Identifier

AAI9512576
(UMI)AAI9512576

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/19122