How Successful Is Data Structure Analysis in Isolating and Analyzing Linked Data Structures?

Meredith, Patrick O'Neil; Pankaj, Balpreet; Sahoo, Swarup K.; Lattner, Chris A.; Adve, Vikram S.

Permalink

https://hdl.handle.net/2142/11124 Copy

Description

Title

How Successful Is Data Structure Analysis in Isolating and Analyzing Linked Data Structures?

Author(s)

• Meredith, Patrick O'Neil
• Pankaj, Balpreet
• Sahoo, Swarup K.
• Lattner, Chris A.
• Adve, Vikram S.

Issue Date

2005-11

Keyword(s)

• data structures
• data structure analysis

Abstract

This report describes a set of experiments to evaluate qualitatively the effectiveness of Data Structure Analysis (DSA) in identifying properties of a program's data structures. We manually inspected several benchmarks to identify linked data structures and their properties, and compared these against the results produced by DSA. The properties we considered are those that were the primary goals of DSA: distinguishing different kinds of data structures, distinct instances of a particular kind, type information for objects within an LDS, and information about the lifetime of such objects (particularly, those local to a function rather than global). We define a set of metrics for the DS graphs computed by DSA that we use to summarize our results concisely for each benchmark. The results of the study are summarized in the last section.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11124

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections