New, simpler linear-time dominators algorithm

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 6, 1998, Pages 1265-1296

  Buchsbaum, Adam L ^a   Kaplan, Haim ^a   Rogers, Anne ^a   Westbrook, Jeffery R ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; GRAPH THEORY; PROGRAM COMPILERS;

PATH COMPRESSION;

DATA FLOW ANALYSIS;

EID: 0032266860     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/295656.295663     Document Type: Article

References (29)

1. AHO, A. V. AND ULLMAN, J. D. 1972. The Theory of Parsing, Translation, and Compiling. Vol. 2, Compiling. Prentice-Hall, Englewood Cliffs, N.J.
2. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass.
3. ALSTRUP, S., HAREL, D., LAURIDSEN, P. W., AND THORUP, M. 1997. Dominators in linear time. Manuscript available at ftp://ftp.diku.dk/pub/diku/users/stephen/dom.ps.
4. AMARASINGHE, S. P., ANDERSON, J. M., LAM, M. S., AND TSENG, C. W. 1995. The SUIF compiler for scalable parallel machines. In Proceedings of the 7th SIAM Conference on Parallel Processing for Scientific Computing. SIAM, Philadelphia, Pa.
5. APPEL, A. W. 1998. Modern Compiler Implementation in C. Cambridge University Press, Cambridge, U.K.
6. BUCHSBAUM, A. L., KAPLAN, H., ROGERS, A., AND WESTBROOK, J. R. 1998. Linear-time pointer-machine algorithms for least common ancestors, MST verification and dominators. In Proceedings of the 30th ACM Symposium on Theory of Computing. ACM, New York, 279-88.
7. BUCHSBAUM, A. L., SUNDAR, R., AND TARJA, R. E. 1995. Data-structural bootstrapping, linear path compression, and catenable heap-ordered double-ended queues. SIAM J. Comput. 24, 6, 1190-1206.
8. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1991. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. MIT Press, Cambridge, Mass.
9. CYTRON, R., FERRANTE, J., ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F. K. 1991. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst. 13, 4, 451-90.
10. DIXON, B. AND TARJAN, R. E. 1997. Optimal parallel verification of minimum spanning trees in logarithmic time. Algorithmica 17, 11-8.
11. FERRANTE, J., OTTENSTEIN K., AND WARREN, J. 1987. The program dependency graph and its uses in optimization. ACM Trans. Program. Lang. Syst. 9, 3, 319-49.
12. FREDMAN, M. L. AND WILLIARD, D. E. 1994. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci. 48, 533-51.
13. GABOW, H. N. AND TARJAN, R. E. 1985. A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30, 2, 209-21.
14. HAREL, D. 1985. A linear time algorithm for finding dominators in flow graphs and related problems. In Proceedings of the 17th ACM Symposium on Theory of Computing. ACM, New York, 185-94.
15. HOLLOWAY, G. AND YOUNG, C. 1997. The flow analysis and transformation libraries of Machine SUIF. In Proceedings of the 2nd SUIF Compiler Workshop. Stanford University, Stanford, Calif.
16. LENGAUER, T. AND TARJAN, R. E. 1979. A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1, 1, 121-41.
17. LOEBL, M. AND NEŠETŘIL, J. 1997. Linearity and unprovability of set union problem strategies I. Linearity of strong postorder. J. Alg. 23, 207-20.
18. LORRY, E. S. AND MEDLOCK, V. W. 1969. Object code optimization. Commun. ACM 12, 1, 13-22.
19. LUCAS, J. M. 1990. Postorder disjoint set union is linear. SIAM J. Comput. 19, 5, 868-82.
20. PEREIRA, F. AND RILEY, M. 1997. Speech recognition by composition of weighted finite automata. In Finite-State Language Processing. MIT Press, Cambridge, Mass.
21. PEREIRA, F., RILEY, M., AND SPROAT, R. 1994. Weighted rational transductions and their application to human language processing. In Proceedings of the ARPA Human Language Technology Confernce. 249-54.
22. PINGALI, K. AND BILARDI, G. 1997. Optimal control dependence computation and the Roman chariots problem. ACM Trans. Program. Lang. Syst. 19, 3, 462-555.
23. PURDOM, P. W. AND MOORE, E. F. 1972. Algorithm 430: Immediate predominators in a directed graph. Commun. ACM 15, 8, 777-8.
24. SPEC. 1995. The SPEC95 Benchmark Suite. The Standard Performance Evaluation Corp., Manassas, Va. http://www.specbench.org.
25. TARJAN, R. E. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 2, 146-59.
26. TARJAN, R. E. 1974. Finding dominators in directed graphs. SIAM J. Comput. 3, 1, 62-89.
27. TARJAN, R. E. 1979a. Applications of path compression on balanced trees. J. ACM 26, 4, 690-715.
28. TARJAN, R. E. 1979b. A class of algorithms which require nonlinear time to maintain disjoint sets. J. Comput. Syst. Sci. 18, 2, 110-27.
29. TARJAN, R. E. AND VAN LEEUWEN, J. 1984. Worst-case analysis of set union algorithms. J. ACM 31, 2, 245-81.