Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup  Home/Search
Context Related
| diku.dk/diku/semantics/pa...D321.ps.gz diku.dk/pub/diku/users/st...domstruc.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: diku.dk/researchgroups/to...1996 (more) From: diku.dk/~stephen/newpapers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Recently it has been discovered that control flow graphs of structured programs have bounded treewidth. In this paper we show that this knowledge can be used to design fast algorithms for control flow analysis. We give a linear time algorithm for the problem of finding the immediate multiple-vertex dominator set for all nodes in a control flow graph. The problem was originally proposed by Gupta (Generalized dominators and post-dominators, ACM Symp. on Principles of Programming Languages,... (Update)
Context of citations to this paper: More
...may now be applied in control flow graph analysis. The constants bounding the tree width are truly small ( 6) allowing us to develop algorithms working well in both theory and practice. A concrete application of bounded tree width within control flow graph analysis is presented in...
.... structural information can then, as with series parallel graphs, be used to improve on the quality of the compiler optimization, see e.g. [2, 3, 8]. Informally, a graph of treewidth k can be decomposed by taking subsets of vertices of size # k 1, called bags, as nodes of a tree,...
Cited by: More
Parameterized Complexity After (Almost) 10 Years: Review and.. - Downey, Fellows (Correct)
Catamorphic Approach to Program Analysis - Ogawa, Hu, Sasano, Takeichi (2003) (Correct)
The Treewidth of Java Programs - Gustedt, Mæhle, Telle (2002) (Correct)
Active bibliography (related documents): More All
0.8: Algorithm for Finding Immediate Multiple-Vertex Dominators. - Alstrup, Clausen, Jørgensen (1996) (Correct)
0.8: An O(|V|*|E|) Algorithm for Finding Immediate.. - Alstrup, Clausen.. (1996) (Correct)
0.6: Structured Programs have Small Tree-Width and Good Register.. - Thorup (1995) (Correct)
Similar documents based on text: More All
0.5: Dominators in Linear Time - Alstrup, Lauridsen, Thorup (1997) (Correct)
0.4: Finding Cores of Limited Length - Alstrup, Lauridsen, Thorup (2001) (Correct)
0.3: Undirected Single Source Shortest Path in Linear Time - Thorup (1997) (Correct)
Related documents from co-citation: More All
4: A linear time algorithm for finding tree-decompositions of small treewidth - Bodlaender - 1996
4: Fixed-parameter tractability and Completeness I: Basic Results - Downey, Fellows - 1995
2: Automatic Generation of Linear-Time Algorithms from Predicate Calculus Descripti.. (context) - Borie, Parker et al. - 1992
BibTeX entry: (Update)
S. Alstrup, P.W. Lauridsen, and M. Thorup, Generalized dominators for structured programs. In Proceedings of the 3rd Static Analysis Symposium, LNCS 1145, pages 42--51, 1996. http://citeseer.ist.psu.edu/alstrup96generalized.html More
@article{ alstrup00generalized,
author = "Stephen Alstrup and Peter W. Lauridsen and Mikkel Thorup",
title = "Generalized Dominators for Structured Programs",
journal = "Algorithmica",
volume = "27",
number = "3",
pages = "244-253",
year = "2000",
url = "citeseer.ist.psu.edu/alstrup96generalized.html" }
Citations (may not include all citations):866 Techniques and Tools (context) - Aho, Sethi et al. - 1986
476 programming language (context) - Kernighan, Ritchie - 1978
202 A linear time algorithm for finding tree-decompositions of s.. - Bodlaender - 1993
92 A fast algorithm for finding dominators in a flowgraph (context) - Lengauer, Tarjan - 1979
69 Revised report on the algorithmic language algol (context) - Naur - 1963
47 A linear time algorithm for finding dominator in flow graphs.. (context) - Harel - 1985
45 The programming language pascal (context) - Wirth - 1971
32 Finding dominators in directed graphs (context) - Tarjan - 1974
31 A linear time algorithm for placing OE-nodes (context) - Gao, Sreedhar - 1995
18 Generalized dominators and post-dominators (context) - Gupta - 1992
15 Structured programs have small tree-width and good register .. - Thorup - 1995
14 Immediate predominators in a directed graph (context) - Purdom, Moore - 1972
10 A simple algorithm for global data flow analysis of programs (context) - Hecht, Ullman - 1975
6 This article was processed using the L A T E X macro package.. (context) - Wirth, modula- et al. - 1985
5 Information processing letters (context) - Gupta - 1995
3 DJ-graphs and their application to flowgraph analyses (context) - Gao, Lee et al. - 1994
2 algorithm for finding immediate multiple-vertex dominators - Alstrup, Clausen et al. - 1996
Documents on the same site (http://www.diku.dk/research-groups/topps/bibliography/1996.html): More
What Not to Do When Writing an Interpreter for Specialisation - Jones (1996) (Correct)
Controlling Conjunctive Partial Deduction of.. - Glück, Jørgensen.. (1996) (Correct)
Bootstrapping Higher-Order Program Transformers from.. - Sperber, Glück, Thiemann (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC