Detecting equalities of variables: Combining efficiency with precision

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1694, Issue , 1999, Pages 232-247

  Rüthing, Oliver ^a   Knoop, Jens ^a   Steffen, Bernhard ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA FLOW ANALYSIS; STATIC ANALYSIS;

BASIC BLOCKS; COMBINING EFFICIENCY; CONTROL FLOWS; PROGRAM POINTS;

ALGORITHMS;

EID: 84957706984     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48294-6_15     Document Type: Conference Paper

References (16)

1. th ACM Symposium on the Principles of Programming Languages (POPL), January 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 Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), volume 30,6 of ACM SIGPLAN Notices, pages 246-257, La Jolla, CA, June 1995.
4. J. Cocke and J. T. Schwartz. Programming languages and their compilers. Courant Institute of Mathematical Sciences, NY, 1970.
5. R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependency graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, 1991.
6. nd ACM Symposium on the Principles of Programming Languages (POPL), pages 1-9, Palo Alto, CA, 1975.
7. J. Hopcroft. An n log n algorithm for minimizing the states of a finite automaton. The Theory of Machines an Computations, pages 189-169, 1971.
8. st ACM Symposium on the Principles of Programming Languages (POPL), pages 194-206, Boston, MA, 1973.
9. th European Symposium on Programming (ESOP), Lecture Notes in Computer Science 1381, pages 154-196, Lisbon, Portugal, 1998. Springer-Verlag.
10. S. S. Muchnick. Advanced Compiler Design & Implementation. Morgan Kaufmann, San Francisco, CA, 1997.
11. M. H. A. Newman. On theories with a combinatorial definition of equivalence. Annals of Math., 43,2:223-243, 1942.
12. th ACM Symposium on the Principles of Programming Languages (POPL), pages 104-118, Los Angeles, CA, 1977.
13. th ACM Symposium on the Principles of Programming Languages (POPL), pages 12-27, San Diego, CA, 1988.
14. L. T. Simpson. Value-driven redundancy elimination. Technical Report TR98-308, Rice University, April 6, 1998.
15. nd International Joint Conference on the Theory and Practice of Software Development (TAPSOFT), Lecture Notes in Computer Science 249, pages 52-68, Pisa, Italy, 1987. Springer-Verlag.
16. rd European Symposium on Programming (ESOP), Lecture Notes in Computer Science 432, pages 389-405, Copenhagen, Denmark, 1990. Springer-Verlag.