Algebraic and graph theoretic characterizations of structured flowchart schemes

DOI10.1016/0304-3975(79)90031-8zbMath0405.68013OpenAlexW2028726185MaRDI QIDQ1257333

Stephen L. Bloom, Ralph Tindell

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)90031-8

Mathematics Subject Classification ID

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

Related Items (8)

Continuation semantics for flowgraph equations ⋮ Step bisimulation is pomset equivalence on a parallel language without explicit internal choice ⋮ Graph theoretic characterization of G-schemes and T L-schemes ⋮ A generalized mathematical theory of structured programming ⋮ A semantically meaningful characterization of reducible flowchart schemes ⋮ Axiomatizing schemes and their behaviors ⋮ Weak equivalence in a class of structured program schemes ⋮ An axiomatization of D-scheme strong equivalence

Cites Work

• Translatability of flowcharts into while programs
• Analysis of structured programs
• A semantically meaningful characterization of reducible flowchart schemes
• Flow Graph Reducibility

This page was built for publication: Algebraic and graph theoretic characterizations of structured flowchart schemes