A fast algorithm for finding dominators in a flowgraph

No abstract is available for this paper.

• Publication year

  1979

• Venue

  ACM Transactions on Programming Languages and Systems

• Publication date

  1979-01-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/357062.357071
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Applications of Path Compression on Balanced Trees

  1979cited by this paper
• Principles of Compiler Design

  1977cited by this paper
• A Simple Algorithm for Global Data Flow Analysis Problems

  1975cited by this paper
• Solving path problems on directed graphs.

  1975cited by this paper
• Finding Dominators in Directed Graphs

  1974cited by this paper
• Edge-disjoint spanning trees, dominators, and depth-first search.

  1974cited by this paper
• The Theory of Parsing, Translation, and Compiling

  1972influential reference
• Depth-First Search and Linear Graph Algorithms

  1972cited by this paper
• Immediate Predominators in a Directed Graph [H] (Algorithm 430)

  1972cited by this paper
• Object code optimization

  1969cited by this paper
• The Art of Computer Programming

  1968cited by this paper
• Zum Hilbertschen Aufbau der reellen Zahlen

  1928cited by this paper

• Mechanized Dominator Tree Certification

  2026cites this paper
• From Separate Compilation to Sound Language Composition

  2026cites this paper
• Orchestrating optimization passes of machine learning compiler for reducing memory footprints of computation graphs

  2026cites this paper
• Efficient Algorithms for the Disjoint Shortest Paths Problem and Its Extensions

  2026influential citation
• Fine-grained Tracing for Performance Anomaly Diagnosis of Serverless Functions

  2026cites this paper
• Rumor Suppression Maximization Algorithm Based on Local Dominance Tree

  2025cites this paper
• Time-Critical Influence Minimization via Node Blocking

  2025cites this paper
• Fault Tree Reliability Analysis via Squarefree Polynomials: Mathematical and Experimental Analysis

  2025cites this paper
• Relational Abstractions Based on Labeled Union-Find

  2025cites this paper
• Influence Minimization via Blocking Strategies

  2025cites this paper
• Fixed-Point-Oriented Programming: A Concise and Elegant Paradigm

  2025cites this paper
• Tady: A Neural Disassembler without Structural Constraint Violations

  2025cites this paper
• Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions

  2025influential citation
• Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut

  2025cites this paper
• Retrofitting Control Flow Graphs in LLVM IR for Auto Vectorization

  2025cites this paper
• ORCAS: Obfuscation-Resilient Binary Code Similarity Analysis using Dominance Enhanced Semantic Graph

  2025cites this paper
• GreyConE+: Efficient Rare-Target Test Generation for FPGA HLS Designs

  2025cites this paper
• TIME[t]⊆ SPACE[O(√t)] via Tree Height Compression

  2025cites this paper
• Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs

  2025cites this paper
• Enhancing configuration security with heterogeneous read points

  2025cites this paper
• Backsolver: Adapting Preceding Execution Paths to Solve Constraints for Concolic Execution

  2025cites this paper
• System Modeling for Smallest Optimizer Compiler System

  2024cites this paper
• Predictable and optimized single-path code for predicated processors

  2024cites this paper
• Efficient Influence Minimization via Node Blocking

  2024cites this paper
• Shining Light on the Inter-procedural Code Obfuscation: Keep Pace with Progress in Binary Diffing

  2024cites this paper
• Optimizing Quantum Circuit Synthesis with Dominator Analysis

  2024cites this paper
• An Optimizing Just-In-Time Compiler for Rotor

  2024cites this paper
• Scalable Test Generation to Trigger Rare Targets in High-Level Synthesizable IPs for Cloud FPGAs

  2024cites this paper
• Minimum+1 (s, t)-cuts and Dual-edge Sensitivity Oracle

  2023cites this paper
• Minimizing the Influence of Misinformation via Vertex Blocking

  2023influential citation
• ConfTainter: Static Taint Analysis For Configuration Options

  2023cites this paper
• Influence Minimization via Blocking Strategies

  2023influential citation
• SolAR: Automated test-suite generation for solidity smart contracts

  2023cites this paper
• Constant-Loop Dominators for Single-Path Code Optimization

  2023cites this paper
• Uncovering Bugs in Code Coverage Profilers via Control Flow Constraint Solving

  2023cites this paper
• Efficient computation of arbitrary control dependencies

  2023cites this paper
• An A^2-Gurobi algorithm for route recommendation with big taxi trajectory data

  2023cites this paper
• Control Flow Duplication for Columnar Arrays in a Dynamic Compiler

  2023cites this paper
• Khaos: The Impact of Inter-procedural Code Obfuscation on Binary Diffing Techniques

  2023cites this paper
• On 2-strong connectivity orientations of mixed graphs and related problems

  2023cites this paper
• SynthDB: Synthesizing Database via Program Analysis for Security Testing of Web Applications

  2023cites this paper
• Fault tree reliability analysis via squarefree polynomials

  2023influential citation
• Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps

  2023cites this paper
• Efficient Sink-Reachability Analysis via Graph Reduction

  2022cites this paper
• Sybil-Proof Diffusion Auction in Social Networks

  2022cites this paper
• The Research on Intelligent Catering Distribution for High-speed Rail

  2022cites this paper
• Hierarchical Memory-Constrained Operator Scheduling of Neural Architecture Search Networks

  2022cites this paper
• Beyond Relooper: recursive translation of unstructured control flow to structured control flow (functional pearl)

  2022cites this paper
• Reduction Rules and ILP Are All You Need: Minimal Directed Feedback Vertex Set

  2022cites this paper
• A Fast and Reliable Sensing Scheme for Distribution Automation Based on IEC61850

  2022cites this paper
• Minimum strongly biconnected spanning directed subgraph problem

  2022cites this paper
• ASPPLN: Accelerated Symbolic Probability Propagation in Logic Network

  2022cites this paper
• Hybrid Information Flow Control for Low-Level Code

  2021cites this paper
• Westworld: Fuzzing-Assisted Remote Dynamic Symbolic Execution of Smart Apps on IoT Cloud Platforms

  2021cites this paper
• Pairwise Reachability Oracles and Preservers under Failures

  2021cites this paper
• Control-Flow-Based Methods to Support the Development of Sound Workflows

  2021cites this paper
• Automated Test-Case Generation for Solidity Smart Contracts: the AGSolT Approach and its Evaluation

  2021cites this paper
• A Hybrid Harmony Search and Particle Swarm Optimization Algorithm (HSPSO) for Testing Non-functional Properties in Software System

  2021cites this paper
• On Time-sensitive Control Dependencies

  2021cites this paper
• Automated Test-Case Generation for Solidity Smart Contracts: the AGSolT Approach and its Evaluation

  2021cites this paper
• Topology and Structure of Directed Acyclic Graphs

  2021cites this paper
• Permissive runtime information flow control in the presence of exceptions

  2021cites this paper
• DAPP: automatic detection and analysis of prototype pollution vulnerability in Node.js modules

  2021cites this paper
• AGSolT: a Tool for Automated Test-Case Generation for Solidity Smart Contracts

  2021cites this paper
• P RO

  2021cites this paper
• UnderTracker: Generating Robust Binaries Using Execution Flow Traces

  2021cites this paper
• Prefix-Graph: A Versatile Log Parsing Approach Merging Prefix Tree with Probabilistic Graph

  2021cites this paper
• HerQules: securing programs via hardware-enforced message queues

  2021cites this paper
• ProGraML: A Graph-based Program Representation for Data Flow Analysis and Compiler Optimizations

  2021cites this paper
• Planar Reachability Under Single Vertex or Edge Failures

  2021cites this paper
• Mitigating Memory-Safety Bugs with Efficient Out-of-Process Integrity Checking

  2021cites this paper
• Optimizing the Parameters of an Evolutionary Algorithm for Fuzzing and Test Data Generation

  2020cites this paper
• A Study on Epidemiology and Its Models

  2020cites this paper
• Supporting the Process of Learning and Teaching Process Models

  2020cites this paper
• Evaluating an Interactive Memory Analysis Tool: Findings from a Cognitive Walkthrough and a User Study

  2020cites this paper
• Minimal Witnesses for Security Weaknesses in Reconfigurable Scan Networks

  2020cites this paper
• Differentially-Private Control-Flow Node Coverage for Software Usage Analysis

  2020cites this paper
• On the Recall of Static Call Graph Construction in Practice

  2020cites this paper
• Automatic Inverse Operation Detection and its Impact in High-level Synthesis

  2020cites this paper
• ProGraML: Graph-based Deep Learning for Program Optimization and Analysis

  2020cites this paper
• Dominance-Partitioned Subgraph Matching on Large RDF Graph

  2020cites this paper
• Memory Leak Analysis using Time-Travel-based and Timeline-based Tree Evolution Visualizations

  2020cites this paper
• Human-centric verification for software safety and security

  2020cites this paper
• Deep Data Flow Analysis

  2020cites this paper
• A Comb for Decompiled C Code

  2020cites this paper
• Pricing Python parallelism: a dynamic language cost model for heterogeneous platforms

  2020cites this paper
• Toward Automated Grammar Extraction via Semantic Labeling of Parser Implementations

  2020cites this paper
• UnderTracker: Binary Hardening Through Execution Flow Verification

  2019cites this paper
• New Bounds for Combinatorial Problems and Quasi-Gray Codes

  2019cites this paper
• RERTL: Finite State Transducer Logic Recovery at Register Transfer Level

  2019cites this paper
• Clusters, Trees, and Phylogenetic Network Classes

  2019cites this paper
• Approximated ZDD Construction Considering Inclusion Relations of Models

  2019cites this paper
• Reengineering Object Oriented Software Systems for a better Maintainability. (Ré-ingénierie des applications à objets pour une amélioration de leurs attributs de qualité)

  2019cites this paper
• Input Elimination Transformations for Scalable Verification and Trace Reconstruction

  2019cites this paper
• Twinless articulation points and some related problems

  2019cites this paper
• ZDOG: zooming in on dominating genes with mutations in cancer pathways

  2019cites this paper
• Synthesis of Benchmarks for the C Programming Language by Mining Software Repositories

  2019cites this paper
• An Experimental Study on Network Immunization

  2019cites this paper
• Enhancing Speculative Execution With Selective Approximate Computing

  2019cites this paper
• Timed Automata for Security of Real-Time Systems

  2019cites this paper