Characterizations of Reducible Flow Graphs
From MaRDI portal
Publication:4060384
Cited in
(31)- Notes on oriented depth-first search and longest paths
- Pathlistings applied to data flow analysis
- Efficient parallel algorithms for path problems in directed graphs
- Testing flow graph reducibility
- Lower bounds on the lengths of node sequences in directed graphs
- Node listings for reducible flow graphs
- Profitability computations on program flow graphs
- Finding the depth of a flow graph
- A semantically meaningful characterization of reducible flowchart schemes
- Solving problems for maximal reducible flowgraphs.
- On the resilience of canonical reducible permutation graphs
- A \(\min\)-\(\max\) relation in flowgraphs and some applications
- Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
- Backward symbolic execution with loop folding
- Verification by gambling on program slices
- Dijkstra graphs
- Full characterization of a class of graphs tailored for software watermarking
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
- Packing feedback arc sets in reducible flow graphs
- Parallel breadth-first search algorithms for trees and graphs
- Flow Hypergraph Reducibility
- Finding dominators via disjoint set union
- Applications of graph theory in computer systems
- Execution traces and programming-language semantics
- Algorithm for formal verification of business process templates
- Dynamic Dominators and Low-High Orders in DAGs
- Flow hypergraph reducibility
- The Choice Construct in the Soufflé Language
- Algebraic characterization of reducible flowcharts
- A region analysis algorithm for the live variables problem
- Fast computation of strong control dependencies
This page was built for publication: Characterizations of Reducible Flow Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060384)
