This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/19122
Description
Title
Categorization and analyzing linked structures
Author(s)
Tsai, Mei-Chin
Issue Date
1994
Doctoral Committee Chair(s)
Harrison, Williams Ludwell, III,
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
Abstract
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.