publication . Preprint . 2013

A Note on "A polynomial-time algorithm for global value numbering"

Nabeezath, Saleena; Paleri, Vineeth;
Open Access English
  • Published: 26 Feb 2013
Abstract
Comment: 5 pages
Subjects
free text keywords: Computer Science - Programming Languages, Computer Science - Logic in Computer Science
Download from

[1] B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting Equality of Variables in Programs, In Proceedings of the 15th ACM Symposium on Principles of Programming Languages, pages 1-11, January 1988. [OpenAIRE]

[2] Appel A. W. Modern Compiler Implementation in Java, Cambridge University Press, 2000.

[3] Sumit Gulwani and George C Necula. A polynomial time Algorithm for Global Value Numbering, Science of Computer Programming, 64(1):97-114, January 2007.

[4] Gary A Kildall. A Unified Approach to Global Program Optimization, ACM Symposium on Principles of Programming Languages, 194-206, 1973. [OpenAIRE]

[5] B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global Value Numbers and Redundant Computations, In Proceedings of the 15th ACM SIGACTSIGPLAN Symposium on Principles of Programming Languages, , pages 12-27, January 1988.

[6] Oliver Ruthing, Jens Knoop, and Bernhard Steffen. Detecting Equality of Variables: Combining Efficiency with Precision, In Proceedings of the 6th International Symposium on Static Analysis, pages 232-247, September 1999.

[7] Jiu-Tao Nie and Xu Cheng. An efficient SSA-based algorithm for Complete Global Value Numbering, In Proceedings of APLAS 2007, LNCS 4807, pages 319-334, 2007. [OpenAIRE]

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue