Algebraic characterization of reducible flowcharts

DOI10.1016/0022-0000(83)90038-7zbMath0532.68018OpenAlexW2066551240MaRDI QIDQ789162

Hartmut Schmeck

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90038-7

zbMATH Keywords

partial ordersemanticsflow theoryfree flow theoryreducible flowchart

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theories (e.g., algebraic theories), structure, and semantics (18C10) Enriched categories (over closed or monoidal categories) (18D20)

Related Items (2)

The refinement calculus of reactive systems ⋮ Graph expressions and graph rewritings

Cites Work

• Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
• More on advice on structuring compilers and proving them correct
• Recursion-closed algebraic theories
• A semantically meaningful characterization of reducible flowchart schemes
• Characterizations of Reducible Flow Graphs
• Structured Programming With and Without go to Statements
• Initial Algebra Semantics and Continuous Algebras
• Flow Graph Reducibility
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic characterization of reducible flowcharts