A semantically meaningful characterization of reducible flowchart schemes

DOI10.1016/0304-3975(79)90016-1zbMath0399.68024OpenAlexW4233486847MaRDI QIDQ1254851

John C. Shepherdson, Calvin C. Elgot

Publication date: 1979

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(79)90016-1

zbMATH Keywords

SemanticsReducible Flowchart Schemes

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (10)

Continuation semantics for flowgraph equations ⋮ Step bisimulation is pomset equivalence on a parallel language without explicit internal choice ⋮ In memoriam Calvin C. Elgot ⋮ More on advice on structuring compilers and proving them correct ⋮ Graph theoretic characterization of G-schemes and T L-schemes ⋮ An algebraic model of synchronous systems ⋮ A generalized mathematical theory of structured programming ⋮ Algebraic and graph theoretic characterizations of structured flowchart schemes ⋮ Calvin C. Elgot (1922-1980) ⋮ Algebraic characterization of reducible flowcharts

Cites Work

• Unnamed Item
• Unnamed Item
• The existence and construction of free iterative theories
• On the algebraic structure of rooted trees
• Algebraic and graph theoretic characterizations of structured flowchart schemes
• Characterizations of Reducible Flow Graphs
• Flow Graph Reducibility
• A Perspective View of Discrete Automata and Their Design

This page was built for publication: A semantically meaningful characterization of reducible flowchart schemes