Programs as partial graphs. II: Recursion

DOI10.1016/0304-3975(81)90068-2zbMath0493.68016OpenAlexW2038144522MaRDI QIDQ1168724

Gunther Schmidt

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90068-2

zbMATH Keywords

correctnessterminationrecursive flow diagram program completeness

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

Relation-algebraic semantics ⋮ Parallel constructions of maximal path sets and applications to short superstrings ⋮ Partiality. II: Constructed relation algebras ⋮ Gunther Schmidt's life as a mathematician and computer scientist ⋮ Programs as partial graphs. I: Flow equivalence and correctness ⋮ Partiality. I: Embedding relation algebras

Cites Work

• Programs as partial graphs. I: Flow equivalence and correctness
• On the completeness of the inductive assertion method
• Decidable Properties of Monadic Functional Schemas
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Programs as partial graphs. II: Recursion