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

DOI10.1016/0304-3975(81)90039-6MaRDI QIDQ1143165zbMATH OpenOpenAlexFDO

Authors Jean 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

semanticsrecursive procedurescorrectnessnondeterministic flowchart programs

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3924117 (Why is no real title available?)
• scientific article; zbMATH DE number 3653565 (Why is no real title available?)
• scientific article; zbMATH DE number 3765113 (Why is no real title available?)
• scientific article; zbMATH DE number 3540387 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3551848 (Why is no real title available?)
• scientific article; zbMATH DE number 3551855 (Why is no real title available?)
• scientific article; zbMATH DE number 3566140 (Why is no real title available?)
• scientific article; zbMATH DE number 3590261 (Why is no real title available?)
• scientific article; zbMATH DE number 3594620 (Why is no real title available?)
• scientific article; zbMATH DE number 195199 (Why is no real title available?)
• scientific article; zbMATH DE number 3362972 (Why is no real title available?)
• scientific article; zbMATH DE number 3415379 (Why is no real title available?)
• Initial Algebra Semantics and Continuous Algebras
• Mathematical theory of partial correctness
• Nondeterministic Algorithms
• On Classes of Program Schemata
• On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs
• On the completeness of the inductive assertion method
• The correctness of nondeterministic programs
• Theory of program structures: Schemes, semantics, verification

Cited in

(4)

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

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

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