ERA

Download the full-sized PDF of Expression data flow graph: precise flow-sensitive pointer analysis for C programsDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3NW5M

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Graduate Studies and Research, Faculty of

Collections

This file is in the following collections:

Theses and Dissertations

Expression data flow graph: precise flow-sensitive pointer analysis for C programs Open Access

Descriptions

Other title
Subject/Keyword
Alias analysis
Points-to analysis
Flow-sensitive
Pointer analysis
Program analysis
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Thiessen, Rei
Supervisor and department
Amaral, José Nelson (Computing Science)
Lhoták, Ondřej (Computing Science)
Examining committee member and department
Cockburn, Bruce (Electrical and Computer Engineering)
Hoover, James (Computing Science)
Department
Department of Computing Science
Specialization

Date accepted
2011-06-21T17:48:42Z
Graduation date
2011-11
Degree
Master of Science
Degree level
Master's
Abstract
Pointer analysis is a program analysis that determines the memory locations pointed to by individual pointers. Imprecise pointer information is a major impediment to data-flow analyses and back-end optimizations that depend on pointer information. Most pointer analyses are based on a points-to abstraction, which is an abstraction of memory that partitions the conceptually infinite number of memory locations into a finite number of abstract objects. In a flow-sensitive pointer-analysis, a points-to relationship between abstract objects is computed at each program point. Our pointer analysis is based on another abstraction called the Expression Data Flow graph, which expresses the memory dependencies between expressions that appear in a program. This abstraction represents pointer information in a more compact and more precise way than a points-to abstraction. We present a flow-sensitive and field-sensitive algorithm that computes a precise Expression Data Flow graph of a program in a negligible amount of time.
Language
English
DOI
doi:10.7939/R3NW5M
Rights
License granted by Rei Thiessen (rei@cs.ualberta.ca) on 2011-06-20T22:05:32Z (GMT): Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of the above terms. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
2014-04-28T21:09:08.854+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 458559
Last modified: 2015:10:12 10:26:35-06:00
Filename: Thiessen_Rei_Fall 2011.pdf
Original checksum: 15ee051a103a54c4a7485bc7e8c55f12
Well formed: true
Valid: true
Page count: 107
Activity of users you follow
User Activity Date