Basic-block graphs: Living dinosaurs?

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

Volumn 1383, Issue , 1998, Pages 65-79

  Knoop, Jens ^a   Koschfitzki, Dirk ^a   Steffen, Bernhard ^b  

^a UNIVERSITY OF PASSAU   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FLOW GRAPHS; GRAPHIC METHODS; OPTIMIZATION;

BASIC BLOCKS; COMPILER SYSTEMS; COMPUTER GENERATION; IS PERFORMANCE; OPTIMIZATION ALGORITHMS; PROGRAM REPRESENTATIONS; RUN-TIME MEASUREMENT; STATE OF THE ART;

PROGRAM COMPILERS;

EID: 84958034716     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0026423     Document Type: Conference Paper

References (26)

1. C. Click and K. D. Cooper. Combining analyses, combining optimizations. ACM Trans. Prog. Lang. Syst., 17(2):181-196, 1995.
2. J. Cocke and K. Kennedy. An algorithm for reduction of operator strength. Comm. ACM, 20(11):850-856, 1977.
3. D. M. Dhamdhere. A fast algorithm for code movement optimization. A CM SIGPLAN Not., 23(10):172-180, 1988.
4. D. M. Dhamdhere. A new algorithm for composite hoisting and strength reduction optimisation (+ Corrigendum). Int. J. Comp. Math., 27:1 - 14 (+ 31 - 32), 1989.
5. D. M. Dhamdhere, B. K. Rosen, and F. K. Zadeck. How to analyze large programs efficiently and informatively. In Proc. ACM SIGPLAN Conf. Prog. Lang. Design and Impl. (PLDI'92), volume 27,7 of ACM SIGPLAN Not., pages 212-223, 1992.
6. V. M. Dhaneshwar and D. M. Dhamdhere. Strength reduction of large expressions. J. Prog. Lang., 3(2):95-120, 1995.
7. A. Fong, J. B. Kam, and J. D. Ullman. Application of lattice algebra to loop optimization. In Conf. Rec. 2nd Syrup. Principles of Prog. Lang. (POPL'75), pages 1-9. ACM, NY, 1975.
8. R. Giegerich, U. Möncke, and R. Wilhelm. Invariance of approximative semantics with respect to program transformations. In Proc. 3rd Conf. Europ. Co-operation in Informatics, Informatik-Fachberichte 50, pages 1-10. Springer-V, 1981.
9. M. S. Hecht. Flow Analysis of Computer Programs. Elsevier, North-Holland, 1977.
10. S. Horwitz, A. Demers, and T. Teitelbanm. An efficient general iterative algorithm for data flow analysis. Acta Informatica, 24:679-694, 1987.
11. J. B. Kam and J. D. Ullmam Monotone data flow analysis frameworks. Acta Informatica, 7:309-317, 1977.
12. K. Kennedy. A survey of data flow analysis techniques. In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 1, pages 5-54. Prentice Hall, Englewood Cliffs, New Jersey, 1981.
13. G. A. Kildall. A unified approach to global program optimization. In Conf. Rec. 1st Syrup. Principles of Prog. Lang. (POPL '73), pages 194-206. ACM, NY, 1973.
14. M. Klein, J. Knoop, D. Koschiitzki, and B. Steffen. DFA & OPT-META Frame: A toot kit for program analysis and optimization. In Proc. 2nd Int. Workshop on Tools and Algorithms for Constr. and Analysis of Syst. (TACAS'96), LNCS 1055, pages 422-426. Springer-V., 1996.
15. J. Knoop, D. Koschützki, and B. Steffen. Basic-block graphs: Living dinosaurs? Technical Report MIP-9715, Fak. f. Math. u. Inf., Univ. Passan, Germany, 1997.
16. J. Knoop, O. Rüthing, and B. Steffen. Optimal code motion: Theory and practice. ACM Trans. Prog. Lang. Syst., 16(4):1117-1155, 1994.
17. J. Knoop, O. Riithing, and B. Steffen. Partial dead code elimination. In Proc. A CM SIGPLAN Conference Prog. Lang. Design and lmpl. ( PLDI'94), volume 29,6 of ACM SIGPLAN Not., pages 147-158, 1994.
18. J. Knoop, B. Steffen, and J. Vollmer. Parallelism for free: Bitvector analyses -+ No state explosion! In Proc. 1st Int. Workshop on Tools and Algorithms for Constr. and Analysis ofSyst. (TACAS'95), LNCS 1019, pages 264-289. Springer-V, 1995.
19. T. J. Marlowe and B. G. Ryder. Properties of data flow frameworks: A unified model. Acta Informatiea, 27:121-163, 1990.
20. E. Morel and C. Renvoise. Global optimization by suppression of partial redundancies. Comm. ACM, 22(2):96-103, 1979.
21. B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global value numbers and redundant computations. In Conf. Rec. 15th Syrup. Principles of Prog. Lang. (POPL '88), pages 2-27. ACM, NY, 1988.
22. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 289-233. Prentice Hall, Englewood Cliffs, New Jersey, 1981.
23. B. Steffen, J. Knoop, and O. Riithing. The value flow graph: A program representation for optimal program transformations. In Proc. 3rd Europ. Syrup. Programming (ESOP'90), LNCS 432, pages 389-405. Springer-V., 1990.
24. B. Steffen, T. Margaria, A. Claiβen, V. Braun, and M. Reitenspiefl. An environment for the creation of intelligent network services. In Annual Review Comm., Int. Eng. Consortium Chicago (USA), IEC, (invited contribution), pages 919-935, 1996. Also invited contribution to the book "Intelligent Networks: IN/AIN Technologies, Operations, Services, and Applications - A Comprehensive Report", IEC, 1996, pp. 287-300.
25. B. Steffen, T. Margaria, A. Claβen, V. Braun, M. Reitenspieβ, and H. Wendler. Service creation: Formal verification and abstract views. In Proc. 4th Int. Conf. Intelligent Networks (ICIN'96), pages 96-101, 1996.
26. St. W. K. Tijan and J. L. Hennessy. Sharlit -- A tool for building optimizers. In Proc. ACM SIGPLAN Conf. Prog. Lang. Design and Impl. (PLDI'92), volume 27,7 of ACM SIGPLAN Not., pages 82-93, 1992.