See this document in CiteSeerX!

Gated SSA-Based Demand-Driven Symbolic Analysis (1995)  (Make Corrections)  (45 citations)
Peng Tu, David Padua
International Conference on Supercomputing



  Home/Search   Context   Related

 
View or download:
uiuc.edu/reports/1336.ps.gz
uiuc.edu/reports/1336.ps.gz
uiuc.edu/pub/CSRD_Reports/...1336.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  uiuc.edu/tech_reports (more)
From:  uiuc.edu/report...ports.html.save
(Enter author homepages)

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

Abstract: It has become increasingly evident... This paper presents a technique to determine the equality and inequality relations between symbolic expressions. The problem of determining the relationship between symbolic expressions is undecidable in general. In practice, symbolic expressions often contain the program input variables whose run-time values may be needed in the analysis. Therefore, the goal of the techniques presented below is to handle with reasonable efficiency some of the situations... (Update)

Cited by:   More
Access Regions: - Toward Powerful Parallelizing   (Correct)
Array Data Dependence Testing with the Chains of.. - van Engelen, Birch.. (2004)   (Correct)
Tracking Pointers with Path and Context Sensitivity for Bug.. - Livshits, Lam (2003)   (Correct)

Similar documents (at the sentence level):
38.4%:   Gated SSA-Based Demand-Driven Symbolic Analysis for.. - Tu, Padua (1995)   (Correct)
22.5%:   Automatic Array Privatization And Demand-Driven Symbolic Analysis - Tu (1995)   (Correct)

Active bibliography (related documents):   More   All
0.1:   An Overview of Symbolic Analysis Techniques Needed for the.. - Blume, Eigenmann (1994)   (Correct)
0.1:   An Overview Of Symbolic Analysis Techniques Needed For The.. - Blume, Eigenmann (1994)   (Correct)
0.1:   Interprocedural Analysis Based on Guarded Array Regions - Li, Gu, Lee   (Correct)

Similar documents based on text:   More   All
0.8:   Efficient Building and Placing of Gating Functions - Peng Tu And (1995)   (Correct)
0.1:   Automatic Array Privatization - Tu (1993)   (Correct)
0.1:   Chaotic Signal Synthesis with Real-Time Control: Solving.. - Yadegari (2003)   (Correct)

Related documents from co-citation:   More   All
17:   Efficiently Computing Static Single Assignment Form and the Control Dependence G.. - Cytron, Ferrante et al. - 1991
15:   Compilers: Principles (context) - Aho, Sethi et al. - 1986
13:   A practical algorithm for exact array dependence analysis (context) - Pugh - 1992

BibTeX entry:   (Update)

P. Tu and D. Padua. Gated SSA-Based demand-driven symbolic analysis for parallelizing compilers. In Proc. Int. Conf. on Supercomputing, pages 414--423, July 1995. This article was processed using the L A T E X macro package with LLNCS style http://citeseer.ist.psu.edu/tu95gated.html   More

@inproceedings{ tu95gated,
    author = "Peng Tu and David A. Padua",
    title = "Gated {SSA}-based Demand-Driven Symbolic Analysis for Parallelizing Compilers",
    booktitle = "International Conference on Supercomputing",
    pages = "414--423",
    year = "1995",
    url = "citeseer.ist.psu.edu/tu95gated.html" }
Citations (may not include all citations):
4212   Computers and Intractability: A Guide to the Theory of the N.. (context) - Garey, Johnson - 1979
415   Efficiently computing static single assignment form and the .. - Cytron, Ferrante et al. - 1991
250   Automatic Discovery of Linear Restraints among Variables of .. - Cousot, Halbwachs - 1978
129   Global Value Numbers and Redundant Computation (context) - Rosen, Wegman et al. - 1988
119   Detecting Equality of Variables in Programs (context) - Alpern, Wegman et al. - 1988
106   Automatic array privatization - Tu, Padua - 1993
86   The Program Dependence Web: a Representation Supporting Cont.. (context) - Ballance, Maccabe et al. - 1990
68   Beyond induction variables - Wolfe - 1992
64   The Range Test: A Dependence Test for Symbolic (context) - Blume, Eigenmann - 1994
37   Polaris: The Next Generation in Parallelizing Compilers - Blume, Eigenmann et al. - 1994
31   Symbolic program analysis and optimization for parallelizing.. - Haghighat, Polychronopoulos - 1992
28   or The Value of Renaming for Parallelism Detection and Stora.. (context) - Cytron, Ferante et al. - 1987
26   IEEE Transactions on Software Engineering (context) - Cheatham, Holloway et al. - 1979
15   Applications of Symbolic Evaluation (context) - Clarke, Richardson - 1985
13   Symbolic Analysis Techniques Needed for the Effective Parall.. (context) - Blume, Eigenmann - 1994



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


Documents on the same site (http://www.csrd.uiuc.edu/tech_reports.html):   More
Automatic Detection Of Nondeterminacy, And Scalar Optimizations In .. - Ghosh (1992)   (Correct)
Run-time Visualization of Program Data - Tuchman, Jablonowski, Cybenko (1991)   (Correct)
PTOPP - A Practical Toolset for the Optimization of Parallel.. - McClaughry (1992)   (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