The treewidth of java programs

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

Volumn 2409, Issue , 2002, Pages 86-97

  Gustedt, Jens ^a   Mæhle, Ole A ^b   Telle, Jan Arne ^b  

^a LORIA   (France)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); DATA FLOW ANALYSIS; DYNAMIC PROGRAMMING; FLOW GRAPHS; GRAPHIC METHODS; PROGRAM COMPILERS; TREES (MATHEMATICS); ALGORITHMS; COMPUTER SOFTWARE; OPTIMIZATION;

BOUNDED TREEWIDTH; COMPILER OPTIMIZATIONS; CONTROL FLOW GRAPHS; EMPIRICAL TEST; OPTIMIZATION PROBLEMS; REGISTER ALLOCATION; TREE DECOMPOSITION; TREE STRUCTURES;

JAVA PROGRAMMING LANGUAGE;

EID: 84929086618     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45643-0_7     Document Type: Conference Paper

References (9)

1. [1] A. V. Aho, R. Sethi, and J. D. Ullman. Compilers, Principles, Techniques and Tools. Addison-Wesley, 1986
2. [2] S. Alstrup, P. Lauridsen, and M. Thorup. Generalized dominators for structured programs. In Proceedings of the 3rd Static Analysis Symposium, volume 1145 of LNCS, pages 42–51, 1996
3. [3] H. Bodlaender, J. Gustedt, and J. A. Telle. Linear-time register allocation for a fixed number of registers and no stack variables. In Proceedings 9th ACM-SIAM Symposium on Discrete Algorithms (SODA’98), pages 574–583, 1998
4. [4] E. W. Dijkstra. Go to statement considered harmful. Comm. ACM, 11(3):147–148, 1968
5. [5] S. Kannan and T. Proebsting. Register allocation in structured programs. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 360–368, San Francisco, California, 22–24 Jan. 1995
6. T. Nishizeki, K. Takamizawa, and N. Saito. Algorithms for detecting series-parallel graphs and D-charts. Trans. Inst. Elect. Commun. Eng. Japan, 59(3):259–260, 1976
7. [7] N. Robertson and P. Seymour. Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms, 1986
8. 8[] M. Thorup. Structured programs have small tree-width and good register allocation. Information and Computation, 142(2), 1998
9. [9] J. van Leeuwen. Handbook of Theoretical Computer Science, volume A, chapter Graph Algorithms - Classes of graphs, pages 545–551. Elsevier, Amsterdam, 1990.