On the public citation graph
Flow Graph Reducibility
0 signed · 167 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bfb0059695openalex-snapshot
Structure and meaning of elementary programs
inferredcites →https://doi.org/10.1016/s0022-0000(71)80008-9openalex-snapshot
Algorithmic approximations
inferredcites →https://doi.org/10.1080/00207167108803048openalex-snapshot
A global flow analysis algorithm
inferredcites →https://doi.org/10.1145/321679.321682openalex-snapshot
Linear and Context-Free Graph Grammars
inferredcites →https://doi.org/10.1145/362929.362947openalex-snapshot
Letters to the editor: go to statement considered harmful
inferredcites →https://doi.org/10.1145/363567.363570openalex-snapshot
Letters to the editor: The go to statement reconsidered
inferredcites →https://doi.org/10.1145/390013.808480openalex-snapshot
Global common subexpression elimination
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230150106openalex-snapshot
On digraphs with a rooted tree structure
inferred← citeshttps://doi.org/10.1002/smr.291openalex-snapshot
Displaying dependence graphs: a hierarchical approach
inferred← citeshttps://doi.org/10.1002/spe.1059openalex-snapshot
A study of irreducibility in C programs
inferred← citeshttps://doi.org/10.1002/spe.4380130909openalex-snapshot
An experimental COBOL restructuring system
inferred← citeshttps://doi.org/10.1007/11767077_16openalex-snapshot
Using Mathematics to Improve Ada Compiled Code
inferred← citeshttps://doi.org/10.1007/3-540-07389-2_198openalex-snapshot
Control structures in single block programs
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_76openalex-snapshot
Structural invariants for some classes of structured programs
inferred← citeshttps://doi.org/10.1007/3-540-10704-5_7openalex-snapshot
The subgraph homeomorphism problem on reducible flow graphs
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_18openalex-snapshot
Decompilation of control structures by means of graph transformations
inferred← citeshttps://doi.org/10.1007/3-540-19422-3_4openalex-snapshot
Graph languages defined by systems of forbidden structures: A survey
inferred← citeshttps://doi.org/10.1007/3-540-46423-9_8openalex-snapshot
Simple Generation of Static Single-Assignment Form
inferred← citeshttps://doi.org/10.1007/978-1-4613-8177-8_10openalex-snapshot
Structured Programming With and Without GO TO Statements
inferred← citeshttps://doi.org/10.1007/978-1-4613-8177-8_11openalex-snapshot
A Semantically Meaningful Characterization of Reducible Flowchart Schemes
inferred← citeshttps://doi.org/10.1007/978-1-4613-8177-8_12openalex-snapshot
An Equational Axiomatization of the Algebra of Reducible Flowchart Schemes
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_33openalex-snapshot
Formally Validating a Practical Verification Condition Generator
inferred← citeshttps://doi.org/10.1007/978-3-0348-5997-4_4openalex-snapshot
Endliche Church-Rosser-Operatoren auf Graphen und ein Intervall-Algorithmus
inferred← citeshttps://doi.org/10.1007/978-3-540-30175-2_17openalex-snapshot
Compiling Process Graphs into Executable Code
inferred← citeshttps://doi.org/10.1007/978-3-540-30468-5_10openalex-snapshot
Untangling Unstructured Cyclic Flows – A Solution Based on Continuations
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_28openalex-snapshot
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_11openalex-snapshot
A New Algorithm for Identifying Loops in Decompilation
inferred← citeshttps://doi.org/10.1007/978-3-642-19823-6_5openalex-snapshot
Data Flow Analysis In Software Reliability
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_32openalex-snapshot
Dominators, Directed Bipolar Orders, and Independent Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_6openalex-snapshot
Towards a Provably Resilient Scheme for Graph-Based Watermarking
inferred← citeshttps://doi.org/10.1007/bf00289078openalex-snapshot
Fast algorithms for the elimination of common subexpressions
inferred← citeshttps://doi.org/10.1007/bf00289306openalex-snapshot
Pathlistings applied to data flow analysis
inferred← citeshttps://doi.org/10.1007/bf00991069openalex-snapshot
Applications of graph theory in computer systems
inferred← citeshttps://doi.org/10.1007/bf01237234openalex-snapshot
Properties of data flow frameworks
inferred← citeshttps://doi.org/10.1007/bf01374523openalex-snapshot
The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
inferred← citeshttps://doi.org/10.1007/bf02246433openalex-snapshot
Function iteration logics and flowchart schemata
inferred← citeshttps://doi.org/10.1007/bfb0012794openalex-snapshot
Algebraic semantics of recursive flowchart schemes
inferred← citeshttps://doi.org/10.1007/bfb0017382openalex-snapshot
An algebraic theory of graph reduction
inferred← citeshttps://doi.org/10.1007/s00453-005-1174-xopenalex-snapshot
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs
inferred← citeshttps://doi.org/10.1007/s00453-018-0486-6openalex-snapshot
A Polynomial-Time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00557-wopenalex-snapshot
Full Characterization of a Class of Graphs Tailored for Software Watermarking
inferred← citeshttps://doi.org/10.1007/s10270-009-0133-4openalex-snapshot
Synthesis of test scenarios using UML activity diagrams
inferred← citeshttps://doi.org/10.1007/s10878-015-9922-6openalex-snapshot
Packing feedback arc sets in reducible flow graphs
inferred← citeshttps://doi.org/10.1007/s11538-010-9506-7openalex-snapshot
Quantifying the Extent of Lateral Gene Transfer Required to Avert a ‘Genome of Eden’
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90038-7openalex-snapshot
Algebraic characterization of reducible flowcharts
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90031-0openalex-snapshot
Efficient symbolic analysis of programs
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90009-8openalex-snapshot
On locating minimum feedback vertex sets
inferred← citeshttps://doi.org/10.1016/0096-0551(78)90009-7openalex-snapshot
Use-definition chains with applications
inferred← citeshttps://doi.org/10.1016/0141-1195(89)90030-2openalex-snapshot
A hypergraph-based hierarchial data structure and its applications
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90013-2openalex-snapshot
A contraction algorithm for finding small cycle cutsets
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90032-3openalex-snapshot
Correctness of parallel programs: The Church-Rosser approach
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90016-1openalex-snapshot
A semantically meaningful characterization of reducible flowchart schemes
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90031-8openalex-snapshot
Algebraic and graph theoretic characterizations of structured flowchart schemes
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90040-4openalex-snapshot
A generalised mathematical theory of structured programming
inferred← citeshttps://doi.org/10.1016/0898-1221(76)90027-4openalex-snapshot
Profitability computations on program flow graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.02.006openalex-snapshot
Flow hypergraph reducibility
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.038openalex-snapshot
On the resilience of canonical reducible permutation graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.04.021openalex-snapshot
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.002openalex-snapshot
A New Neighborhood for the QAP
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.044openalex-snapshot
Flow Hypergraph Reducibility
inferred← citeshttps://doi.org/10.1016/j.jss.2020.110590openalex-snapshot
More precise construction of static single assignment programs using reaching definitions
inferred← citeshttps://doi.org/10.1016/j.scico.2007.02.002openalex-snapshot
Generalized structured programs and loop trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.009openalex-snapshot
Min (a)cyclic feedback vertex sets and min ones monotone 3-SAT
inferred← citeshttps://doi.org/10.1016/s0019-9958(74)90766-9openalex-snapshot
Unique-entry graphs, flowcharts, and state diagrams
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90473-4openalex-snapshot
Programs with minimal goto statements
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90742-3openalex-snapshot
Top-down design in the context of parallel programs
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80032-1openalex-snapshot
Algebraic semantics of recursive flowchart schemes
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80006-1openalex-snapshot
Translatability of flowcharts into while programs
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80043-7openalex-snapshot
Analysis of structured programs
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80049-8openalex-snapshot
Testing flow graph reducibility
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80042-6openalex-snapshot
Node listings for reducible flow graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00449-9openalex-snapshot
Solving problems for maximal reducible flowgraphs
inferred← citeshttps://doi.org/10.1109/cic.2006.22openalex-snapshot
An Empirical Study of Iterative Data-Flow Analysis
inferred← citeshttps://doi.org/10.1109/compsacw.2012.116openalex-snapshot
An Efficient Graph Codec System for Software Watermarking
inferred← citeshttps://doi.org/10.1109/edoc.2006.21openalex-snapshot
Combining Analysis of Unstructured Workflows with Transformation to Structured Workflows
inferred← citeshttps://doi.org/10.1109/icimtech.2016.7930334openalex-snapshot
Comparing sorting algorithm complexity based on control flow structure
inferred← citeshttps://doi.org/10.1109/icsm.2012.6405325openalex-snapshot
Dependence communities in source code
inferred← citeshttps://doi.org/10.1109/sccc.1997.637099openalex-snapshot
Hamiltonian problems for reducible flowgraphs
inferred← citeshttps://doi.org/10.1109/sfcs.1976.17openalex-snapshot
Graph grammars and global program data flow analysis
inferred← citeshttps://doi.org/10.1109/swat.1972.1openalex-snapshot
A fast algorithm for the elimination of common subexpressions
inferred← citeshttps://doi.org/10.1109/tse.1976.233800openalex-snapshot
Structured Programming With and Without go to Statements
inferred← citeshttps://doi.org/10.1109/tse.1977.231171openalex-snapshot
On Partitioning Program Graphs
inferred← citeshttps://doi.org/10.1109/tsmcc.2008.919178openalex-snapshot
An Incremental Approach to the Analysis and Transformation of Workflows Using Region Trees
inferred← citeshttps://doi.org/10.1109/wcre.2001.957807openalex-snapshot
Node coarsening calculi for program slicing
inferred← citeshttps://doi.org/10.1109/worldcis17046.2011.5749891openalex-snapshot
A survey of static software watermarking
inferred← citeshttps://doi.org/10.1137/0203006openalex-snapshot
Finding Dominators in Directed Graphs
inferred← citeshttps://doi.org/10.1137/0203018openalex-snapshot
A Note on the Hecht-Ullman Characterization of Nonreducible Flow Graphs
inferred← citeshttps://doi.org/10.1137/0204044openalex-snapshot
A Simple Algorithm for Global Data Flow Analysis Problems
inferred← citeshttps://doi.org/10.1137/0205011openalex-snapshot
On Finding Lowest Common Ancestors in Trees
inferred← citeshttps://doi.org/10.1137/0211007openalex-snapshot
Symbolic Program Analysis in Almost-Linear Time
inferred← citeshttps://doi.org/10.1145/1008343.1008344openalex-snapshot
A Church-Rosser theorem for graph grammars
inferred← citeshttps://doi.org/10.1145/1706299.1706337openalex-snapshot
From program verification to program synthesis
inferred← citeshttps://doi.org/10.1145/174147.169807openalex-snapshot
An algebraic theory of graph reduction
inferred← citeshttps://doi.org/10.1145/2383276.2383295openalex-snapshot
Multiple encoding of a watermark number into reducible permutation graphs using cotrees
inferred← citeshttps://doi.org/10.1145/2480741.2480743openalex-snapshot
Intermediate representations in imperative compilers
inferred← citeshttps://doi.org/10.1145/267959.269971openalex-snapshot
Making graphs reducible with controlled node splitting
inferred← citeshttps://doi.org/10.1145/2801948.2801981openalex-snapshot
Encoding numbers into reducible permutation graphs using heap-ordered trees
inferred← citeshttps://doi.org/10.1145/2882903.2882926openalex-snapshot
Extracting Equivalent SQL from Imperative Code in Database Applications
inferred← citeshttps://doi.org/10.1145/3003733.3003741openalex-snapshot
Graph-structured Watermarking using Bitonic Sequences of Self-inverting Permutations
inferred← citeshttps://doi.org/10.1145/3139367.3139436openalex-snapshot
Experimental Study of the Resilience of a Graph-based Watermarking System under Edge Modifications
inferred← citeshttps://doi.org/10.1145/3149.3159openalex-snapshot
Feedback vertex sets and cyclically reducible graphs
inferred← citeshttps://doi.org/10.1145/3213846.3213867openalex-snapshot
Symbolic path cost analysis for side-channel detection
inferred← citeshttps://doi.org/10.1145/321832.321835openalex-snapshot
Characterizations of Reducible Flow Graphs
inferred← citeshttps://doi.org/10.1145/321850.321862openalex-snapshot
Testing for the Church-Rosser Property
inferred← citeshttps://doi.org/10.1145/321921.321939openalex-snapshot
A Fast and Usually Linear Algorithm for Global Flow Analysis
inferred← citeshttps://doi.org/10.1145/322261.322272openalex-snapshot
A Unified Approach to Path Problems
inferred← citeshttps://doi.org/10.1145/322261.322273openalex-snapshot
Fast Algorithms for Solving Path Problems
inferred← citeshttps://doi.org/10.1145/322358.322371openalex-snapshot
Vector Execution of Flow Graphs
inferred← citeshttps://doi.org/10.1145/3289239.3291460openalex-snapshot
Identifying Input-Dependent Jumps from Obfuscated Execution using Dynamic Data Flow Graphs
inferred← citeshttps://doi.org/10.1145/3371082openalex-snapshot
Deterministic parallel fixpoint computation
inferred← citeshttps://doi.org/10.1145/3547621openalex-snapshot
Beyond Relooper: recursive translation of unstructured control flow to structured control flow (functional pearl)
inferred← citeshttps://doi.org/10.1145/356674.356676openalex-snapshot
Data Flow Analysis in Software Reliability
inferred← citeshttps://doi.org/10.1145/356876.356879openalex-snapshot
Validation, Verification, and Testing of Computer Software
inferred← citeshttps://doi.org/10.1145/359367.359368openalex-snapshot
Structured programming in Cobol
inferred← citeshttps://doi.org/10.1145/359863.359888openalex-snapshot
An algorithm for reduction of operator strength
inferred← citeshttps://doi.org/10.1145/360018.360025openalex-snapshot
A program data flow analysis procedure
inferred← citeshttps://doi.org/10.1145/48014.48021openalex-snapshot
Eliminating go to's while preserving program structure
inferred← citeshttps://doi.org/10.1145/512760.512769openalex-snapshot
Symbolic program analysis in almost linear time
inferred← citeshttps://doi.org/10.1145/512927.512946openalex-snapshot
Analysis of a simple algorithm global data flow problems
inferred← citeshttps://doi.org/10.1145/512950.512958openalex-snapshot
Applications of a graph grammar for program control flow analysis
inferred← citeshttps://doi.org/10.1145/512976.512977openalex-snapshot
Application of lattice algebra to loop optimization
inferred← citeshttps://doi.org/10.1145/512976.512978openalex-snapshot
Node listings applied to data flow analysis
inferred← citeshttps://doi.org/10.1145/512976.512979openalex-snapshot
A fast and usually linear algorithm for global flow analysis
inferred← citeshttps://doi.org/10.1145/78969.78963openalex-snapshot
An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
inferred← citeshttps://doi.org/10.1145/800113.803640openalex-snapshot
Dichotomization, reachability, and the forbidden subgraph problem(Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800116.803767openalex-snapshot
Node listings for reducible flow graphs
inferred← citeshttps://doi.org/10.1145/800125.804040openalex-snapshot
Testing flow graph reducibility
inferred← citeshttps://doi.org/10.1145/800125.804055openalex-snapshot
Analysis of structured programs
inferred← citeshttps://doi.org/10.1145/800125.804056openalex-snapshot
On finding lowest common ancestors in trees
inferred← citeshttps://doi.org/10.1145/800141.804658openalex-snapshot
Vector execution of flow graphs(Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800168.811545openalex-snapshot
An algorithm for structuring programs (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800182.810402openalex-snapshot
A method to expose the hidden structure of Fortran programs
inferred← citeshttps://doi.org/10.1145/800191.805514openalex-snapshot
Flow graph analysis using linear connected regions
inferred← citeshttps://doi.org/10.1145/800192.805690openalex-snapshot
A survey of compiler optimization techniques
inferred← citeshttps://doi.org/10.1145/987316.987320openalex-snapshot
On extending Fortran control structures to facilitate structured programming
inferred← citeshttps://doi.org/10.1147/sj.441.0047openalex-snapshot
Declarative techniques for model-driven business process integration
inferred← citeshttps://doi.org/10.11588/heidok.00029213openalex-snapshot
Exploiting BSP Abstractions for Compiler Based Optimizations of GPU Applications on multi-GPU Systems
inferred← citeshttps://doi.org/10.1587/transinf.e97.d.524openalex-snapshot
A Buffer Overflow Based Algorithm to Conceal Software Watermarking Trigger Behavior
inferred← citeshttps://doi.org/10.17877/de290r-16409openalex-snapshot
Tight integration of cache, path and task-interference modeling for the analysis of hard real time systems
inferred← citeshttps://doi.org/10.2514/6.1981-2323openalex-snapshot
VHSIC impact on signal processing architecture
inferred← citeshttps://doi.org/10.3233/jcs-210048openalex-snapshot
Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks
inferred← citeshttps://doi.org/10.3929/ethz-a-006050258openalex-snapshot
Automatic transformation from graphical process models to executable code
inferred← citeshttps://doi.org/10.3929/ethz-b-000489720openalex-snapshot
Formally Validating a Practical Verification Condition Generator (extended version)
inferred← citeshttps://doi.org/10.48550/arxiv.1110.1194openalex-snapshot
Efficient Encoding of Watermark Numbers as Reducible Permutation Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1403.6658openalex-snapshot
WaterRPG: A Graph-based Dynamic Watermarking Model for Software Protection
inferred← citeshttps://doi.org/10.48550/arxiv.1607.02281openalex-snapshot
Two RPG Flow-graphs for Software Watermarking using Bitonic Sequences of Self-inverting Permutations
inferred← citeshttps://doi.org/10.48550/arxiv.1802.06328openalex-snapshot
Minimum length RNA folding trajectories
inferred← citeshttps://doi.org/10.48550/arxiv.1809.01998openalex-snapshot
Min (A)cyclic Feedback Vertex Sets and Min Ones Monotone 3-SAT
inferred← citeshttps://doi.org/10.48550/arxiv.1812.11080openalex-snapshot
Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks
inferred← citeshttps://doi.org/10.5220/0004432802770284openalex-snapshot
Design and Evaluation of a Graph Codec System for Software Watermarking
inferred← citeshttps://doi.org/10.5220/0004509600740085openalex-snapshot
A Dynamic Watermarking Model for Embedding Reducible Permutation Graphs into Software
inferred← citeshttps://doi.org/10.5381/jot.2010.9.3.a4openalex-snapshot
Analysis and Transformation of Behavioral Models Containing Overlapped Patterns.
inferred← citeshttps://doi.org/10.5555/2032497.2032502openalex-snapshot
The beauty and the beast: separating design from algorithm
inferred← citeshttps://doi.org/10.5555/800099.803203openalex-snapshot
A graph theoretic approach to the verification of program structures
inferred← citeshttps://doi.org/10.6100/ir402436openalex-snapshot
Generalized data flow graphs : theory and applications
inferred← citeshttps://doi.org/10.70675/de040967z6217z413dzbf5az3e3b83c3b8d0openalex-snapshot
Subdivisions of digraphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.