Characterizations of Reducible Flow Graphs

DOI10.1145/321832.321835zbMath0304.68041OpenAlexW2023541076MaRDI QIDQ4060384

Publication date: 1974

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321832.321835

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (30)

Fast computation of strong control dependencies ⋮ Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT ⋮ Backward symbolic execution with loop folding ⋮ Verification by gambling on program slices ⋮ Packing feedback arc sets in reducible flow graphs ⋮ Notes on oriented depth-first search and longest paths ⋮ Dijkstra graphs ⋮ Full characterization of a class of graphs tailored for software watermarking ⋮ Finding dominators via disjoint set union ⋮ On the resilience of canonical reducible permutation graphs ⋮ Flow Hypergraph Reducibility ⋮ Pathlistings applied to data flow analysis ⋮ Flow hypergraph reducibility ⋮ Solving problems for maximal reducible flowgraphs. ⋮ Algorithm for formal verification of business process templates ⋮ Applications of graph theory in computer systems ⋮ Efficient parallel algorithms for path problems in directed graphs ⋮ Parallel breadth-first search algorithms for trees and graphs ⋮ A \(\min\)-\(\max\) relation in flowgraphs and some applications ⋮ 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 ⋮ Encoding watermark numbers as reducible permutation graphs using self-inverting permutations ⋮ Dynamic Dominators and Low-High Orders in DAGs ⋮ Execution traces and programming-language semantics ⋮ Algebraic characterization of reducible flowcharts ⋮ A region analysis algorithm for the live variables problem

This page was built for publication: Characterizations of Reducible Flow Graphs