Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I

DOI10.1016/0304-3975(81)90039-6zbMath0441.68011OpenAlexW4213187981MaRDI QIDQ1143165

Jean H. Gallier

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)90039-6

zbMATH Keywords

correctnesssemanticsrecursive proceduresnondeterministic flowchart programs

Mathematics Subject Classification ID

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

Related Items (4)

On flowchart theories. II: The nondeterministic case ⋮ Semantics of algorithmic languages ⋮ In Scott-Strachey style denotational semantics, parallelism implies nondeterminism ⋮ Equivalences among logics of programs

Cites Work

• Theory of program structures: Schemes, semantics, verification
• On the completeness of the inductive assertion method
• On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs
• The correctness of nondeterministic programs
• Mathematical theory of partial correctness
• Initial Algebra Semantics and Continuous Algebras
• Nondeterministic Algorithms
• On Classes of Program Schemata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I