On the complexity of constant propagation

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

Volumn 2028, Issue , 2001, Pages 190-205

  Muller Olm, Marküs ^a   Ruthing, Oliver ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONSTANT PROPAGATION; LOOP FREE; RUNTIMES; UPPER BOUND;

ARTIFICIAL INTELLIGENCE;

EID: 84945284307     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45309-1_13     Document Type: Conference Paper

References (20)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1985.
2. C. Click and K. D. Cooper. Combining analyses, combining optimizations. ACM Transactions on Programming Languages and Systems, 17(2):181-196, 1995.
3. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. W.H. Freeman & Co, San Francisco, 1979.
4. M. S. Hecht. Flow Analysis of Computer Programs. Elsevier, North-Holland, 1977.
5. N. D. Jones and S. S Muchnick. Complexity of flow analysis, inductive assertion synthesis, and a language due to Dijkstra. In [10], chapter 12, pages 380-393.
6. M. Karr. Affine relationships among variables of a program. Acta Informatica, 6:133-151, 1976.
7. J. Knoop and O. Ruthing. Constant propagation on the value graph: simple constants and beyond. In CC’2000, LNCS 1781, pages 94-109, Berlin, Germany, 2000. Springer-Verlag.
8. W. Landi. Undecidability of static analysis. ACM Letters on Programming Languages and Systems, 1(4):323-337, 1992.
9. S. S. Muchnick. Advanced Compiler Design & Implementation. Morgan Kaufmann, San Francisco, CA, 1997.
10. S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prentice Hall, Englewood Cliffs, NJ, 1981.
11. M. Muller-Olm. The complexity of copy constant detection in parallel programs. In STACS’2001, LNCS, 2001. Springer-Verlag. To appear.
12. R. Muth and S. Debray. On the complexity of flow-sensitive dataflow analysis. In POPL’2000, pages 67-81, ACM, Boston, MA, 2000.
13. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
14. W. Pugh. The Omega Test: a fast and practical integer programming algorithm for dependence analysis. In IEEE, editor, Supercomputing’91, Albuquerque, NM, pages 4-13. IEEE Computer Society Press, 1991.
15. W. Pugh and D. Wonnacott. Constraint-based array dependence analysis. ACM Transactions on Programming Languages and Systems, 20(3):635-678, 1998.
16. J. H. Reif and R. Lewis. Symbolic evaluation and the gobal value graph. POPL’77, pages 104-118, ACM, Los Angeles, CA, 1977.
17. M. Sagiv, T. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Computer Science, 167(1-2):131-170, 1996.
18. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In [10], chapter 7, pages 189-233.
19. B. Steffen and J. Knoop. Finite constants: Characterizations of a new decidable set of constants. Theoretical Computer Science, 80(2):303-318, 1991.
20. M. N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 13(2), 1991.