See this document in CiteSeerX!

Symbolic Reaching Definitions Analysis of Ada Programs (1998)  (Make Corrections)  (8 citations)
Johann Blieberger, Bernd Burgstaller
Lecture Notes in Computer Science



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
auto.tuwien.ac.at/~bli...ada98_lncs.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  auto.tuwien.ac.at/~blieb...papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: A data-flow framework for symbolic reaching definitions analysis is presented. It produces a more accurate solution of the reaching definitions problem than can be achieved with "classic" data-flow analysis. (Update)

Context of citations to this paper:   More

...flow reaches a given program point. In the past symbolic evaluation has been successfully 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...

.... (cf. e.g. Cheatham et al. 1979; Ploedereder, 1980; Clarke and Richardson, 1981; Scholz, 1996; Blieberger et al. 2000b; Blieberger and Burgstaller, 1998; Blieberger et al. 1999; Blieberger et al. 2000a; Fahringer and Scholz, 1997) In addition a path condition...

Cited by:   More
Symbolic Data Flow Analysis for Detecting - Deadlocks In Ada   (Correct)
Interprocedural Symbolic Evaluation of Ada Programs with .. - Blieberger.. (1999)   (Correct)
Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Symbolic Cache Analysis for Real-Time Systems - Blieberger, Fahringer, Scholz (1999)   (Correct)
0.2:   Symbolic Data Flow Analysis for Detecting Deadlocks.. - Blieberger.. (2000)   (Correct)
0.1:   On Sparse Evaluation Representations - Ramalingam (1998)   (Correct)

Similar documents based on text:   More   All
0.6:   A Monotone Data Flow System for Analyzing Explicitly.. - Grunwald, Srinivasan (1992)   (Correct)
0.5:   Data Flow Equations for Explicitly Parallel Programs - Grunwald, Srinivasan (1993)   (Correct)
0.5:   Sparse Data-Flow Analysis for DAG Parallel Programs - Stoltz, Wolfe (1994)   (Correct)

Related documents from co-citation:   More   All
8:   Symbolic Evaluation and the Analysis of Programs (context) - Cheatham, Jr et al. - 1979
6:   Symbolic Evaluation for Parallelizing Compilers - Fahringer, Scholz - 1997
4:   Compilers: Principles (context) - Aho, Sethi et al. - 1986

BibTeX entry:   (Update)

Blieberger, J. and B. Burgstaller: 1998, `Symbolic Reaching Definitions Analysis of Ada Programs'. In: Proc. of the Ada-Europe International Conference on Reliable Software Technologies. pp. 238--250. http://citeseer.ist.psu.edu/blieberger98symbolic.html   More

@article{ blieberger98symbolic,
    author = "Johann Blieberger and Bernd Burgstaller",
    title = "Symbolic Reaching Definitions Analysis of {Ada} Programs",
    journal = "Lecture Notes in Computer Science",
    volume = "1411",
    pages = "238--??",
    year = "1998",
    url = "citeseer.ist.psu.edu/blieberger98symbolic.html" }
Citations (may not include all citations):
1399   Compilers: principles (context) - Aho, Seti et al. - 1986
116   Monotone data flow analysis frameworks (context) - Kam, Ullman - 1977  ACM   DBLP
50   Elimination algorithms for data flow analysis (context) - Ryder, Paull - 1986  ACM   DBLP
39   Properties of data flow frameworks - a unified model (context) - Marlowe, Ryder - 1990
16   Symbolic evaluation and the analysis of programs (context) - Cheatham, Holloway et al. - 1979  DBLP
15   Information-flow and data-flow analysis of whileprograms (context) - Bergeretti, CarrY - 1985
13   Combining static worst-case timing analysis and program proo.. (context) - Chapman, Burns et al. - 1996  ACM   DBLP
10   Ada Reference manual (context) - IEC - 1995
6   Efficient Program Analysis Using DJ Graphs (context) - Sreedhar - 1995  ACM
5   Data-flow frameworks for worst-case execution time analysis - Blieberger - 1997  ACM   DBLP
1   Global data fiow analysis and iterative algorithms (context) - Karo, Ullman - 1976
1   Algorithm Design - A Recursion Transformation lramework (context) - Paull - 1988



The graph only includes citing articles where the year of publication is known.


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