Algorithm visualization using concrete and abstract shape graphs
Abstract
References
Index Terms
- Algorithm visualization using concrete and abstract shape graphs
Recommendations
Computation of alias sets from shape graphs for comparison of shape analysis precision
Various shape analyses have been introduced, but their precision often cannot be compared because they use different representations of analysis results. The aim of the authors work was to compare the precision of two well‐known graph‐based shape analyses,...
Solving shape-analysis problems in languages with destructive updating
This article concerns the static analysis of programs that perform destructive updating on heap-allocated storage. We give an algorithm that uses finite shape graphs to approximate conservatively the possible “shapes” that heap-allocated structures in a ...
Precise shape analysis using field sensitivity
We present a static shape analysis technique to infer the shapes of the heap structures created by a program at run time. Our technique is field sensitive in that it uses field information to compute the shapes. The shapes of the heap structures are ...
Comments
Information & Contributors
Information
Published In

- General Chair:
- Rainer Koschke,
- Program Chairs:
- Christopher Hundhausen,
- Alexandru Telea
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 536Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in