Global value numbering using random interpretation

ACM SIGPLAN Notices

Volumn 39, Issue 1, 2004, Pages 342-352

  Gulwani, Sumit ^a   Necula, George C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Global value numbering; Herbrand equivalences; Random interpretation; Randomized algorithm; Uninterpreted functions

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; POLYNOMIALS; PROGRAM INTERPRETERS; RANDOM NUMBER GENERATION;

GLOBAL VALUE NUMBERING; HERBRAND EQUIVALENCES; RANDOM INTERPRETATION; RANDOMIZED ALGORITHM; UNINTERPRETED FUNCTIONS;

PROGRAM DIAGNOSTICS;

EID: 1342347999     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/982962.964030     Document Type: Conference Paper

References (18)

1. B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting equality of variables in programs. In 15th Annual ACM Symposium on Principles of Programming Languages, pages 1-11. ACM, 1988.
2. P. Briggs, K. D. Cooper, and L. T. Simpson. Value numbering. Software Practice and Experience, 27(6):701-724, June 1997.
3. C. Click. Global code motion/global value numbering. In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation, pages 246-257, June 1995.
4. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages, pages 234-252, 1977.
5. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, Oct. 1990.
6. K. Gargi. A sparse algorithm for predicated global value numbering. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation, volume 37, 5, pages 45-56. ACM Press, June 17-19 2002.
7. S. Gulwani and G. C. Necula. Discovering affine equalities using random interpretation. In 30th Annual ACM Symposium on Principles of Programming Languages, pages 74-84. ACM, Jan. 2003.
8. S. Gulwani and G. C. Necula. Global value numbering using random interpretation. Technical Report UCB//CSD-03-1296, University of California, Berkeley, 2003.
9. G. A. Kildall. A unified approach to global program optimization. In 1st ACM Symposium on Principles of Programming Language, pages 194-206. ACM, Oct. 1973.
10. S. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, San Francisco, 2000.
11. G. C. Necula. Translation validation for an optimizing compiler. In Proceedings of the ACM SIGPLAN '00 Conference on Programming Language Design and Implementation, pages 83-94. ACM SIGPLAN, 18-21 June 2000.
12. A. Pnueli, M. Siegel, and E. Singerman. Translation validation. In B. Steffen, editor, Tools and Algorithms for Construction and Analysis of Systems, 4th International Conference, TACAS '98, volume LNCS 1384, pages 151-166. Springer, 1998.
13. B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global value numbers and redundant computations. In 15th Annual ACM Symposium on Principles of Programming Languages, pages 12-27. ACM, 1988.
14. O. Rüthing, J. Knoop, and B. Steffen. The value flow graph: A program representation for optimal program transformations. In N. D. Jones, editor, Proceedings of the European Symposium on Programming, pages 389-405. Springer-Verlag LNCS 432, 1990.
15. O. Rüthing, J. Knoop, and B. Steffen. Detecting equalities of variables: Combining efficiency with precision. In Static Analysis Symposium, volume 1694 of Lecture Notes in Computer Science, pages 232-247. Springer, 1999.
16. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. JACM, 27(4):701-717, Oct. 1980.
17. B. Steffen. Optimal run time optimization - proved by a new look at abstract interpretations. In 2nd International Joint Conference on Theory and Practice of Software Development (TAPSOFT'87), volume 249 of LNCS, pages 52-68. Springer-Verlag, March 1987.
18. M. N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 13(2):181-210, Apr. 1991.