All Structured Programs Have Small Tree Width and Good Register Allocation

Information and Computation

Volumn 142, Issue 2, 1998, Pages 159-181

  Thorup, Mikkel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008779759     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2697     Document Type: Article

References (41)

1. Alstrup, S., Lauridsen, P. W., and Thorup, M. (1996), Generalized dominators for structured programs, in "Proceedings of the 3rd Static Analysis Symposium," Lecture Notes in Computer Science, Vol. 1145, pp. 42-51.
2. Aho, A. V., Sethi, R., and Ullman, J. D. (1986), "Compilers: Principles, Techniques, and Tools," Addison-Wesley, Reading, MA.
3. Amborg, S., Corneil, D. G., and Proskorowski, A. (1987), Complexity of finding embeddings in a k-tree, SIAM J. Alg. Discrete Methods 8, 277-284.
4. Amborg, S., Lagergren, J., and Seese, D. (1991), Easy problems for tree decomposable graphs, J. Algorithms 12, 308-340.
5. Amborg, S., and Proskorowski, A. (1989), Linear time algorithms for NP-hard problems restricted to partial k-trees, SIAM J. Alg. Discrete Methods 23, 11-24.
6. Birkdal, L., Tofte, M., and Vejlstrup, M. (1996), From region inference to von Neuman Machines via region representation inference, in "Proc. POPL'96," pp. 171-183.
7. Bodlaender, H. L. (1993), A tourist guide through tree width, Acta Cybernetica 11, 1-23.
8. Bodlaender, H. L. (1996), A linear time algorithm for finding tree decompositions of small tree width, SIAM J. Comput. 25(6), 1305-1317.
9. Bodlaender, H. L. (1993), Complexity of path forming games, Theoret. Comput. Sci. 110, 215-245.
10. Bodlaender, H. L., Gilbert, J. R., Hafsteinsson, H., and Kloks, T. (1995), Approximating tree width, path width, frontsize, and shortest elimination tree, J. Algorithms 18(2), 221-237.
11. Bodlaender, H. L., Gustedt, J., Telle, J. A. (1998), Linear-time register allocation for a fixed number of registers, in "Proc. 9th SODA," to appear.
12. Borie, R. B., Parker, R. G., and Tovey, C. A. (1992), Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica 7, 555-581.
13. Briggs, P. (1992), Register allocation via graph coloring, Ph.D. Thesis, Rice University.
14. Briggs, P., Cooper, K. D., Kennedy, K., and Torczon, L. (1989), Coloring heuristics for register allocation, in "Proc. SIGPLAN'89 Conf. Programming Language Design and Implementation," pp. 275-284.
15. Callahan, D., and Koblenz, B. (1991), Register allocation via hierarchical graph coloring, in "Proc. SIGPLAN'91 Conf. Programming Language Design and Implementation," pp. 192-203.
16. Chaitin, G. J. (1982), Register allocation and spilling via graph coloring, in "Proc. SIGPLAN'82 Symp. Compiler Construction," pp. 98-105.
17. Chaitin, G. J., Auslander, M. A., Chandra, A. K., Cocke, J., Hoplins, M. E., and Markstein, P. W. (1981), Register allocation via graph coloring, Comput. Lang. 6, 47-57.
18. Courcelle, B., and Mosbah, M. (1993), Monadic second-order evaluations on tree decomposable graphs, Theoret. Comput. Sci. 109, 49-82.
19. Dahl, O. J., Dijkstra, E. W., and Hoare, C. A. R. (1972), "Structured Programming," Academic Press, London.
20. Dendris, N., Kirousis, L., and Thilkos, D. (1997), Fugitive-search games on graphs and related parameters, Theoret. Comput. Sci. 172, 233-254.
21. Dijkstra, E. W. (1968), Go to statement considered harmful, Comm. Assoc. Comput. Mach. 11(3), 147-148.
22. Ershov, A. P. (1962), Reduction of the problem of memory allocation in programming to the problem of colouring the vertices of a graph, Dokl. Acad. Nauk SSSR 142(4), 785-787; English version in Soviet Math. 3, 163-165.
23. Ershov, A. P. (1962), Reduction of the problem of memory allocation in programming to the problem of colouring the vertices of a graph, Dokl. Acad. Nauk SSSR 142(4), 785-787; English version in Soviet Math. 3, 163-165.
24. Garey, M. R., Johnson, D. S., Miller, G. L., and Papadimitriou, C. H. (1980), The complexity of coloring circular arcs and chords, SIAM J. Alg. Discrete Methods 1(2), 216-227.
25. Gavril, F. (1972), Algorithms for minimum coloring, maximum clique, minimum covers by cliques, and maximum independent set of chordal graphs, SIAM J. Comput. 1(2), 180-187.
26. Gavril, F. (1974), The intersection graph of subtrees in trees are exactly the chordal graphs, J. Combin. Theory Ser. B 16, 47-56.
27. Gupta, R., Soffa, M. L., and Steele, T. (1989), Register allocation via clique separators, in "Proc. SIGPLAN'89 Conf. Programming Language Design and Implementation," pp. 264-274.
28. Halldórsson, M. M. (1993), A still better performance guarantee for approximate graph coloring, Inform. Process Lett. 45, 19-23.
29. Kannan, S., and Proebsting, T. (1995), Register allocation in structured programs, in "Proc. 6th SODA," pp. 360-368.
30. Kemighan, B. R., and Ritchie, D. M. (1978), "The C Programming Language," Prentice-Hall, NJ.
31. Knuth, D. E. (1974), Structured programming with go to statements, ACM Comput. Surveys 6(4), 261-301.
32. Lund, C., and Yannakakis, M. (1994), On the hardness of approximating minimization problems, J. Assoc. Comput. Mach. 41, 960-981.
33. Naur, P. (1963), Revised report on the algorithmic language Algol 60, Comm. Assoc. Comput. Mach. 6(1), 1-17.
34. Naur, P. (1963), Go to statements and good Algol style, BIT 3(3), 204-208.
35. Nishizeki, T., Takamizawa, K., and Saito, N. (1976), Algorithms for detecting series-parallel graphs and D-charts, Trans. Inst. Elect. Commun. Engrg. Japan 59(3), 259-260.
36. Norris, C., and Pollock, L. L. (1994), Register allocation over the program dependence graph, in "Proc. SIGPLAN'94 Conf. Programming Language Design and Implementation," pp. 266-277.
37. Robertson, N., and Seymour, P. D. (1983), Graph minors I: Excluding a forest, J. Combin. Theory Ser. B 35, 39-61.
38. Robertson, N., and Seymour, P. D. (1995), Graph minors XIII: The disjoint paths problem, J. Combin. Theory Ser. B 63, 65-110.
39. Tofte, M., and Talpin, J.-P. (1997), Region-based memory management, Inform. and Comput. 132(2), 109-176.
40. Wirth, N. (1971), The programming language PASCAL, Acta Informatica 1, 35-63.
41. Wirth, N. (1985), "Programming in Modula-2 (3rd corr. ed.)," Springer-Verlag, Berlin/New York.