Generalized dominators for structured programs

DOI10.1007/3-540-61739-6_32zbMath1483.68070OpenAlexW1573849647MaRDI QIDQ5030185

P. W. Lauridsen, Stephen Alstrup, Mikkel Thorup

Publication date: 16 February 2022

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61739-6_32

zbMATH Keywords

tree decompositionlinear-time algorithmdominator treegeneralize dominatortree node

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized dominators
• Revised report on the algorithmic language ALGOL 60
• An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators
• The programming language Pascal
• A fast algorithm for finding dominators in a flowgraph
• Finding Dominators in Directed Graphs
• A Simple Algorithm for Global Data Flow Analysis Problems
• A linear time algorithm for finding tree-decompositions of small treewidth

This page was built for publication: Generalized dominators for structured programs