Interprocedural herbrand equalities

Lecture Notes in Computer Science

Volumn 3444, Issue , 2005, Pages 31-45

  Müller Olm, Markus ^a   Seidl, Helmut ^b   Steffen, Bernhard ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

CALL-BY-VALUE PARAMETERS; HERBRAND EQUALITIES; MACHINE-INDEPENDENT OPTIMIZATION; OPERATOR SYMBOLS;

COMPUTER SCIENCE;

EID: 24644508567     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31987-0_4     Document Type: Conference Paper

References (23)

1. B. Alpern, M. Wegman, and F. K. Zadeck. Detecting Equality of Variables in Programs. In 15th ACM Symp. on Principles of Programming Languages (POPL), pages 1-11, 1988.
2. K. R. Apt and G. D. Plotkin. Countable Nondeterminism and Random Assignment. Journal of the ACM, 33(4):724-767, 1986.
3. C. Click and K. D. Cooper. Combining Analyses, Combining Optimizations. ACM Transactions on Programming Languages and Systems, 17(2): 181-196, 1995.
4. J. Cocke and J. T. Schwartz. Programming languages and their compilers. Courant Institute of Mathematical Sciences, NY, 1970.
5. P. Cousot. Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation. Electronic Notes in Theoretical Computer Science, 6, 1997. URL: www.elsevier.nl/locate/entcs/volume6.html.
6. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In 4th ACM Symp. on Principles of Programming Languages (POPL), 1977.
7. P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Recursive Procedures. In E. Neuhold, editor, IFIP Conf. on Formal Description of Programming Concepts, pages 237-277. North-Holland, 1977.
8. K. Gargi. A Sparse Algorithm for Predicated Global Value Numbering. In ACM Conf. on Programming Language Design and Implementation (PLDI), pages 45-56, 2002.
9. S. Gulwani and G. C. Necula. A Polynomial-time Algorithm for Global Value Numbering. In 11th Int. Static Analysis Symposium (SAS),. Springer Verlag, 2004.
10. S. Gulwani and G. C. Necula. Global Value Numbering Using Random Interpretation. In 31st ACM Symp. on Principles of Programming Languages (POPL), pages 342-352, 2004.
11. G. A. Kildall. A Unified Approach to Global Program Optimization. In First ACM Symp. on Principles of Programming Languages (POPL), pages 194-206, 1973.
12. J. Knoop, O. Rüthing, and B. Steffen. Code Motion and Code Placement: Just Synonyms? In 6th ESOP, LNCS 1381, pages 154-196. Springer-Verlag, 1998.
13. J. Knoop and B. Steffen. The Interprocedural Coincidence Theorem. In Compiler Construction (CC), pages 125-140. LNCS 541, Springer-Verlag, 1992.
14. S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prentice Hall, Engelwood Cliffs, New Jersey, 1981.
15. M. Müller-Olm, O. Rüthing, and H. Seidl. Checking Herbrand Equalities and Beyond. In Proceedings of VMCAI 2005. to appear, Springer-Verlag, 2005.
16. M. Müller-Olm, H. Seidl, and B. Steffen. Interprocedural Analysis for Free. Technical Report 790, Fachbereich Informatik, Universität Dortmund, 2004.
17. J. H. Reif and R. Lewis. Symbolic Evaluation and the Gobai Value Graph. In 4th ACM Symp. on Principles of Programming Languages (POPL), pages 104-118, 1977.
18. B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global Value Numbers and Redundant Computations. In 15th ACM Symp. on Principles of Programming Languages (POPL), pages 12-27, 1988.
19. O. Rüthing, J. Knoop, and B. Steffen. Detecting Equalities of Variables: Combining Efficiency with Precision. In 6th Int. Static Analysis Symposium (SAS), LNCS 1694, pages 232-247. Springer-Verlag, 1999.
20. M. Sharir and A. Pnueli. Two Approaches to Interprocedural Data Row Analysis. In [14], chapter 7, pages 189-233.
21. B. Steffen. Optimal Run Time Optimization-Proved by a New Look at Abstract Interpretations. In Proc. 2nd International Joint Conference on Theory and Practice of Software Development (TAPSOFT'87), LNCS 249, pages 52-68. Springer Verlag, 1987.
22. B. Steffen, J. Knoop, and O. Rüthing. The Value Flow Graph: A Program Representation for Optimal Program Transformations. In 3rd European Symp. on Programming (ESOP), LNCS 432, pages 389-405. Springer-Verlag, 1990.
23. B. Steffen, J. Knoop, and O. Rüthing. Efficient Code Motion and an Adaption to Strength Reduction. In 4th International Joint Conference on the Theory and Practice of Software Development (TAPSOFT), LNCS 494, pages 394-415. Springer-Verlag, 1991.