November 2003 Computer Science Division (EECS) University of California...  Home/Search
Context
Related
| berkeley.edu/techrepor...CSD031296.ps 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: berkeley.edu/access...CSD031296 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are treated as uninterpreted functions. We are not aware of any complete polynomialtime deterministic algorithm for the same problem. The algorithm does not require symbolic manipulations and hence is simpler to implement than the deterministic symbolic algorithms. The price for these benefits is that there is a probability... (Update)
Active bibliography (related documents): More All
1.1: Global Value Numbering using Random Interpretation - Gulwani, Necula (2004) (Correct)
0.6: Testing Herbrand Equalities and Beyond - Müller-Olm, Rüthing, Seidl (Correct)
0.2: A Note on Karr's Algorithm - Müller-Olm, Seidl (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ science-report,
author = "November Computer Science",
title = "Report No. UCB/CSD-3-1296",
url = "citeseer.ist.psu.edu/736378.html" }
Citations (may not include all citations):815 Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
415 Efficiently computing static single assignment form and the .. - Cytron, Ferrante et al. - 1990
292 Advanced Compiler Design and Implementation (context) - Muchnick - 2000
156 A unified approach to global program optimization (context) - Kildall - 1973
149 Fast probabilistic algorithms for verification of polynomial.. (context) - Schwartz - 1980
129 Global value numbers and redundant computations (context) - Rosen, Wegman et al. - 1988
119 Detecting equality of variables in programs (context) - Alpern, Wegman et al. - 1988
41 Translation validation for an optimizing compiler - Necula - 2000
32 Translation validation - Pnueli, Siegel et al. - 1998
22 The value flow graph: A program representation for optimal p.. - Ruthing, Knoop et al. - 1990
19 Software Practice and Experience (context) - Briggs, Cooper et al. - 1997
14 Global code motionglobal value numbering (context) - code, value et al. - 1995
9 Optimal run time optimization - proved by a new look at abst.. (context) - Steffen - 1987
6 A sparse algorithm for predicated global value numbering (context) - Gargi - 2002
4 Discovering affine equalities using random interpretation (context) - Gulwani, Necula - 2003
3 Detecting equalities of variables: Combining efficiency with.. (context) - Ruthing, Knoop et al. - 1999
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