Programs as partial graphs. II: Recursion

DOI10.1016/0304-3975(81)90068-2MaRDI QIDQ1168724zbMATH OpenOpenAlexFDO

Authors 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

terminationcorrectnessrecursive flow diagram program completeness

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3602653 (Why is no real title available?)
• scientific article; zbMATH DE number 3621088 (Why is no real title available?)
• scientific article; zbMATH DE number 3628356 (Why is no real title available?)
• Decidable Properties of Monadic Functional Schemas
• On the completeness of the inductive assertion method
• Programs as partial graphs. I: Flow equivalence and correctness

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168724)