Flow Graph Reducibility

DOI10.1137/0201014zbMath0265.68031OpenAlexW1995405030MaRDI QIDQ5681535

Matthew S. Hecht, Jeffrey D. Ullman

Publication date: 1972

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0201014

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items

Efficient symbolic analysis of programs, Packing feedback arc sets in reducible flow graphs, On locating minimum feedback vertex sets, The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem, The directed subgraph homeomorphism problem, Quantifying the extent of lateral gene transfer required to avert a `genome of Eden', Full characterization of a class of graphs tailored for software watermarking, On the resilience of canonical reducible permutation graphs, Flow Hypergraph Reducibility, Pathlistings applied to data flow analysis, Properties of data flow frameworks: A unified model, Flow hypergraph reducibility, Solving problems for maximal reducible flowgraphs., Applications of graph theory in computer systems, Boolean-valued loops, Translatability of flowcharts into while programs, Analysis of structured programs, A generalized mathematical theory of structured programming, Testing flow graph reducibility, Function iteration logics and flowchart schemata, Node listings for reducible flow graphs, Correctness of parallel programs: The Church-Rosser approach, Profitability computations on program flow graphs, A semantically meaningful characterization of reducible flowchart schemes, Encoding watermark numbers as reducible permutation graphs using self-inverting permutations, Algebraic and graph theoretic characterizations of structured flowchart schemes, Algebraic characterization of reducible flowcharts, Fast algorithms for the elimination of common subexpressions