J. Blieberger, B. Burgstaller, B. Scholz  Home/Search
Context Related
Links: ACM DBLP | auto.tuwien.ac.at/~blieb/pa...ada99.pdf 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: auto.tuwien.ac.at/~blieb...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Symbolic Evaluation is a technique aimed at determining dynamic properties of programs. We extend our intraprocedural dataflow framework introduced in [3] to support interprocedural symbolic evaluation. Our data-flow framework utilizes a novel approach based on an array algebra to handle aliases induced by procedure calls. It serves as as a basis for static program analysis (e.g. reaching definitions-, alias analysis, worst-case performance estimations, cache analysis). Examples for... (Update)
Context of citations to this paper: More
...eld is stored in a unique storage location . The third and forth restriction are important to avoid alias e ects of program variables [2] which goes beyond the scope of this paper. In the following we introduce heap algebra H , which is a formal vehicle to symbolically...
.... applied to the reaching definitions problem [2] to worst case execution time analysis [1] to cache hit prediction [4] to alias analysis [3], to optimization problems of High Performance Fortran [12] and to pointer analysis for detecting memory leaks [17] The underlying...
Cited by: More
Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000) (Correct)
Symbolic Data Flow Analysis for Detecting Deadlocks.. - Blieberger.. (2000) (Correct)
Symbolic Pointer Analysis for Detecting Memory Leaks - Scholz, Blieberger, Fahringer (2000) (Correct)
Similar documents (at the sentence level):
67.2%: Interprocedural Symbolic Evaluation of Ada Programs with .. - Blieberger.. (1999) (Correct)
10.2%: Symbolic Reaching Definitions Analysis of Ada Programs - Blieberger, Burgstaller (1998) (Correct)
Active bibliography (related documents): More All
0.4: Symbolic Cache Analysis for Real-Time Systems - Blieberger, Fahringer, Scholz (1999) (Correct)
0.1: Real-Time Properties of Indirect Recursive Procedures - Blieberger (2000) (Correct)
0.1: Symbolic Data Flow Analysis for Detecting - Deadlocks In Ada (Correct)
Similar documents based on text: More All
0.5: A Unified Symbolic Evaluation Framework for Parallelizing.. - Fahringer, Scholz (1999) (Correct)
0.5: Symbolic Evaluation for Parallelizing Compilers - Fahringer, Scholz (1997) (Correct)
0.3: The Dynamic Domain Reduction Procedure for Test Data Generation - Offutt, Jin, Pan (1997) (Correct)
Related documents from co-citation: More All
4: Symbolic cache analysis for real-time systems - Blieberger, Fahringer et al. - 1999
4: Symbolic Evaluation for Parallelizing Compilers - Fahringer, Scholz - 1997
3: Symbolic Reaching Definitions Analysis of Ada Programs - Blieberger, Burgstaller - 1998
BibTeX entry: (Update)
J. Blieberger, B. Burgstaller, and B. Scholz. Interprocedural Symbolic Evaluation of Ada Programs with Aliases. In Ada-Europe'99 International Conference on Reliable Software Technologies, pages 136-145, Santander, Spain, June 1999. http://citeseer.ist.psu.edu/blieberger99interprocedural.html More
@inproceedings{ blieberger99interprocedural,
author = "Johann Blieberger and Bernd Burgstaller and Bernhard Scholz",
title = "Interprocedural Symbolic Evaluation of Ada Programs with Aliases",
booktitle = "Ada-Europe",
pages = "136-145",
year = "1999",
url = "citeseer.ist.psu.edu/blieberger99interprocedural.html" }
Citations (may not include all citations):1399 Compilers: Principles (context) - Aho, Seti et al. - 1986
97 Pointer-induced Aliasing: A Problem Classification (context) - Landi, Ryder - 1992 DBLP
79 Efficient Flow-Sensitive Interprocedural Computation of Poin.. - Choi, Burke et al. - 1993 ACM DBLP
42 Symbolic Analysis for Parallelizing Compilers - Haghighat, Polychronopoulos - 1996 ACM DBLP
20 The Undecidability of Aliasing (context) - Ramalingam - 1994 ACM DBLP
16 Symbolic Evaluation and the Analysis of Programs (context) - Cheatham, Holloway et al. - 1979 DBLP
10 Ada Reference manual (context) - IEC - 1995
8 Symbolic Reaching Definitions Analysis of Ada Programs - Blieberger, Burgstaller - 1998 ACM DBLP
5 Data-flow Frameworks for Worst-Case Execution Time Analysis - Blieberger - 1997 ACM DBLP
2 An Accurate Cache Prediction for C-Programs with Symbolic Ev.. (context) - Blieberger, Fahringer et al. - 1999
1 Efficient Program Analysis Using DJ Graphs (context) - Steedhat - 1995 ACM
Documents on the same site (http://www.auto.tuwien.ac.at/~blieb/papers.html): More
Multi-Staged Discrete Loops for Real-Time Systems - Lieger, Blieberger (Correct)
Symbolic Cache Analysis for Real-Time Systems - Blieberger, Fahringer, Scholz (1999) (Correct)
Worst-Case Space and Time Complexity of Recursive Procedures - Blieberger, LIEGER (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