Uwe Aßmann, Markus Weinhardt  Home/Search
Context
Related
| i44www.info.unika...hardtmppm93.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: i44www.info.unikarls...abstracts (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The parallelization of imperative programs working on pointer data structures is possible by using extensive heap analysis. Therefore we consider a new interprocedural version of the heap analysis algorithm with summary nodes from Chase, Wegman, and Zadeck. Our analysis handles arbitrary call graphs inclusive recursion, works on a realistic low-level intermediate language, and uses a modi ed propagation method to correct an inaccuracy of the original algorithm. Furthermore we discuss how loops... (Update)
Active bibliography (related documents): More All
0.2: Regular Substitution Sets: A Means of Controlling E-Unification - Burghardt (1995) (Correct)
0.2: Implementing Anti-Unification Modulo Equational Theory - Burghardt, Heinz (Correct)
0.2: A Quick Tools Strategy for Program Analysis and Software.. - Johnson, Ornburn, Rugaber (1992) (Correct)
Similar documents based on text: More All
0.4: Research Interests - Aßmann (Correct)
0.2: How to Uniformly Specify Program Analysis and Transformation with .. - Aßmann (1996) (Correct)
0.1: OPTIMIX Language Report (for OPTIMIX 7.0) - Aßmann (1995) (Correct)
BibTeX entry: (Update)
@misc{ mann-interprocedural,
author = "Uwe Aßmann and Markus Weinhardt",
title = "Interprocedural Heap Analysis for Parallelizing Imperative Programs",
url = "citeseer.ist.psu.edu/280398.html" }
Citations (may not include all citations):252 Analysis of Pointers and Structures (context) - Chase, Wegman et al. - 1990
207 Flow Analysis and Optimization of LISP-like Structures (context) - Jones, Muchnick - 1981
146 Parallelizing programs with recursive data structures (context) - Hendren, Nicolau - 1989
99 Dependence analysis for pointer variables (context) - Horwitz, Pfei et al. - 1989
86 A Precise Interprocedural Data Flow Algorithm (context) - Myers - 1982
79 Abstractions for recursive pointer data structures: Improvin.. - Hendren, Hummel et al. - 1992
63 A storeless model of aliasing and its abstractions using nit.. (context) - Deutsch - 1992
22 Designing programming languages for analyzability: A fresh l.. - Hendren, Gao - 1992
15 A exible approach to interprocedural data ow analysis and pr.. (context) - Jones, Muchnick - 1982
14 Detecting con- icts between structure accesses (context) - Larus, Hilnger - 1988
13 An ecient method of computing static single assignment form (context) - Cytron, Ferrante et al. - 1989
5 EDGE: An extendible graph editor (context) - Newbery-Paulisch, Tichy
4 ornige Sortendisziplin und ihre Anwendung in der Programmkon.. (context) - Burghardt - 1992
1 Mobil - An intermediate language for portable optimizing com.. (context) - Schr - 1988
Documents on the same site (http://i44www.info.uni-karlsruhe.de/~assmann/abstracts.html): More
Programming Connectors In an Open Language - Aßmann, Ludwig, Pfeifer (1998) (Correct)
Parallel EARS - Aßmann (1995) (Correct)
How to Uniformly Specify Program Analysis and Transformation with .. - Aßmann (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC