Finding dominators in practice

Journal of Graph Algorithms and Applications

Volumn 10, Issue 1, 2006, Pages 69-94

  Georgiadis, Loukas ^a   Tarjan, Robert E ^a,b   Werneck, Renato F ^a  

^a Princeton University   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38549084141     PISSN: None     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00119     Document Type: Conference Paper

References (45)

1. A. V. Alio, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA, 1986.
2. A. V. Aho and J. D. Ullman. Principles of Compiler Design. Addison-Wesley, 1977.
3. F. E. Allen and J. Cocke. Graph theoretic constructs for program control flow analysis. Technical Report IBM Res. Rep. RC 3923, IBM T.J. Watson Research Center, 1972.
4. S. Allesina and A. Bodini. Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions. Journal of Theoretical Biology, 230(3):351-358, 2004.
5. S. Allesina, A. Bodini, and C. Bondavalli. Secondary extinctions in ecological networks: Bottlenecks unveiled. Ecological Modelling, 2005. In press.
6. S. Alstrup, D. Harel, P. W. Lauridsen, and M. Thorup. Dominators in linear time. SIAM Journal on Computing, 28(6):2117-32, 1999.
7. M. E. Amyeen, W. K. Fuchs, I. Pomeranz, and V. Boppana. Fault equivalence identification using redundancy information and static and dynamic extraction. In Proceedings of the 19th IEEE VLSI Test Symposium, pages 124-130, 2001.
8. A. L. Buchsbaum, L. Georgiadis, H. Kaplan, A. Rogers, R. E. Tarjan, and J. R. Westbrook. Linear-time pointer-machine algorithms for pathevaluation problems on trees and graphs. In preparation.
9. A. L. Buchsbaum, H. Kaplan, A. Rogers, and J. R. Westbrook. A new, simpler linear-time dominators algorithm. ACM Transactions on Programming Languages and Systems, 20(6):1265-96, 1998. Corrigendum appeared in 27(3):383-7, 2005.
10. K. D. Cooper, 2003. Personal communication.
11. K. D. Cooper, T. J. Harvey, and K. Kennedy. A simple, fast dominance algorithm. Available online at http://www.cs.rice.edu/~keith/EMBED/dom.pdf.
12. K. D. Cooper, T. J. Harvey, and K. Kennedy. Iterative data-flow analysis, revisited. Technical Report TR04-432, Department of Computer Science, Rice University, 2004.
13. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, 1991.
14. J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 9:319-349, July 1987.
15. M. J. Fischer. Efficiency of equivalence algorithms. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 153-168. Plenum Press, New York, 1972.
16. H. N. Gabow. Data structures for weighted matching and nearest common ancestors with linking. In Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms, pages 434-443, 1990.
17. A. Gal, C. W. Probst, and M. Franz. Complexity-based denial-of-service attacks on mobile code systems. Technical Report 04-09, School of Information and Computer Science, University of California, Irvine, 2004.
18. A. Gal, C. W. Probst, and M. Franz. Average case vs. worst case: Margins of safety in system design. In Proceedings of the New Security Paradigms Workshop, 2005.
19. L. Georgiadis. Linear-Time Algorithms for Dominators and Related Problems. PhD thesis, Princeton University, 2005.
20. L. Georgiadis and R. E. Tarjan. Finding dominators revisited. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pages 862-871, 2004.
21. L. Georgiadis and R. E. Tarjan. Dominator tree verification and vertexdisjoint paths. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pages 433-442, 2005.
22. L. Georgiadis, R. F. Werneck, R. E. Tarjan, S. Triantafyllis, and D. I. August. Finding dominators in practice. In Proceedings of the 12th Annual European Symposium on Algorithms, volume 3221 of Lecture Notes in Computer Science, pages 677-688, 2004.
23. A. V. Goldberg. Shortest path algorithms: Engineering aspects. In Proceedings of the International Symposium on Algorithms and Computation, volume 2223 of Lecture Notes in Computer Science, pages 502-513. Springer-Verlag, 2001.
24. A. V. Goldberg. A simple shortest path algorithm with linear average time. In Proceedings of the 9th European Symposium, on Algorithms, volume 2161 of Lecture Notes in Computer Science, pages 230-241. Springer-Verlag, 2001.
25. M. S. Hecht and J. D. Ullman. Characterizations of reducible flow graphs. Journal of the ACM, 21(3):367-375, 1974.
26. G. Holloway and C. Young. The flow analysis and transformation libraries of Machine SUIF. In Proceedings of the 2nd SUIF Compiler Workshop, 1997.
27. The IMPACT compiler, http://www.crhc.uiuc.edu/IMPACT.
28. J. B. Kam and J. D. Ullman. Global data flow analysis and iterative algorithms. Journal of the ACM, 23:158-171, 1976.
29. D. E. Knuth. An empirical study of FORTRAN programs. Software Practice and Experience, 1:105-133, 1971.
30. T. Lengauer and R. E. Tarjan. A fast algorithm for finding dominators in a flowgraph. ACM Transactions on Programming Languages and Systems, 1(1):121-41, 1979.
31. B. M. E. Moret and H. D. Shapiro. An empirical assessment of algorithms for constructing a minimum spanning tree. DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science, 15:99-117, 1994.
32. S. S. Muchnick. Advanced Compiler Design and Implementation, chapter 14. Morgan-Kaufmann Publishers, San Francisco, CA, 1997.
33. M. Poggi de Aragão and R. F. Werneck. On the implementation of MST-based heuristics for the Steiner problem in graphs. In Proceedings of the 4th International Workshop on Algorithm Engineering and Experiments, volume 2409 of Lecture Notes in Computer Science, pages 1-15. Springer-Verlag, 2002.
34. P. W. Purdom, Jr. and E. F. Moore. Algorithm 430: Immediate predominators in a directed graph. Communications of the ACM, 15(8):777-778, 1972.
35. L. Quesada, P. Van Roy, Y. Deville, and R. Collet. Using dominators for solving constrained path problems. In Proceedings of the 8th International Symposium on Practical Aspects of Declarative Languages, volume 3819 of Lecture Notes in Computer Science, pages 73-87. Springer-Verlag, 2006.
36. M. Sharir. Structural analysis: A new approach to flow analysis in optimizing compilers. Computer Languages, 5(3): 141-153, 1980.
37. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26:362-391, 1983.
38. The Standard Performance Evaluation Corp. http://www.spec.org/.
39. P. H. Sweany and S. J. Beaty. Dominator-path scheduling: A global scheduling method. In Proceedings of the 25th International Symposium on Microarchitecture, pages 260-263, 1992.
40. R. E. Tarjan. Testing flow graph reducibility. In Proceedings of the 5th Annual ACM Symposium on Theory of Computing, pages 96-107, 1973.
41. R. E. Tarjan. Finding dominators in directed graphs. SIAM Journal on Computing, 3(1):62-89, 1974.
42. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2):212-225, 1975.
43. R. E. Tarjan. Applications of path compression on balanced trees. Journal of the ACM, 26(4):690-715, 1979.
44. R. E. Tarjan and J. van Leeuwen. Worst-case analysis of set union algorithms. Journal of the ACM, 31(2):245-81, 1984.
45. The CAD Benchmarking Lab, North Carolina State University. ISCAS'89 benchmark information, http://www.cbl.ncsu.edu/www/CBL_Docs/iscas89.html.