(Enter summary)
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)
Cited by: More
Path-Sensitive Analysis for Linear Arithmetic and - Uninterpreted Functions Sumit
(Correct)
Report No. UCB/CSD-4-1353 - August Computer Science
(Correct)
Global Value Numbering using Random Interpretation - Gulwani, Necula (2004)
(Correct)
Active bibliography (related documents): More All
1.1: Report No. UCB/CSD-3-1296 - November Computer Science
(Correct)
0.8: Testing Herbrand Equalities and Beyond - Müller-Olm, Rüthing, Seidl
(Correct)
0.3: Interprocedural Analysis (Almost) for Free - Müller-Olm, Seidl, Steffen
(Correct)
Similar documents based on text: More All
0.3: Oracle-Based Checking of Untrusted Software - Necula, Rahul (2001)
(Correct)
0.3: WebCaL: A Domain-Specific Language for Web Caching - Tarachandani, Gulwani (2000)
(Correct)
0.3: Proof Generation in the Touchstone Theorem Prover - Necula, Lee (2000)
(Correct)
Related documents from co-citation: More All
4: Global value numbers and redundant computations (context) - Rosen, Wegman et al. - 1988
4: A polynomial-time algorithm for global value numbering (context) - Gulwani, Necula - 2004
4: Detecting equality of variables in programs (context) - Alpern, Wegman et al. - 1988
BibTeX entry: (Update)
S. Gulwani and G. C. Necula. Global value numbering using random interpretation. In Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 342--352. ACM Press, 2004. http://citeseer.ist.psu.edu/gulwani04global.html More
@misc{ gulwani04global,
author = "S. Gulwani and G. Necula",
title = "Global value numbering using random interpretation",
text = "S. Gulwani and G. C. Necula. Global value numbering using random interpretation.
In Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of
programming languages, pages 342--352. ACM Press, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/gulwani04global.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..
- uthing, 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
5
Global value numbering using random interpretation
- Gulwani, Necula - 2003
4
Discovering affine equalities using random interpretation (context) - Gulwani, Necula - 2003
3
Detecting equalities of variables: Combining efficiency with.. (context) - uthing, Knoop et al. - 1999
Documents on the same site (http://pag.lcs.mit.edu/reading-group/fall03.html): More
MJ: A Rational Module System for Java - And Its Applications
(Correct)
Context-Sensitive Slicing of Concurrent Programs - Krinke (2003)
(Correct)
Deadline Analysis of Interrupt-driven Software - Dennis Brylow Jens (2003)
(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