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

DOI10.1016/S0304-3975(81)80001-1MaRDI QIDQ1152704zbMATH OpenFDO

Authors Jean Gallier

Publication date 1981

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

zbMATH Keywords

semanticsrecursive procedurescorrectnesssecond-order predicate calculusnondeterministic flowchart programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Cites work

• scientific article; zbMATH DE number 3537204 (Why is no real title available?)
• scientific article; zbMATH DE number 3550151 (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 3594620 (Why is no real title available?)
• scientific article; zbMATH DE number 3594629 (Why is no real title available?)
• scientific article; zbMATH DE number 3448070 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• scientific article; zbMATH DE number 3322506 (Why is no real title available?)
• scientific article; zbMATH DE number 3346357 (Why is no real title available?)
• scientific article; zbMATH DE number 3351184 (Why is no real title available?)
• scientific article; zbMATH DE number 3415379 (Why is no real title available?)
• Automatic program verification. I: A logical basis and its implementation
• Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes
• First-order dynamic logic
• Formalization of Properties of Functional Programs
• Is “sometime” sometimes better than “always”?
• Mathematical theory of partial correctness
• Nondeterministic Algorithms
• On the completeness of the inductive assertion method
• Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
• The correctness of nondeterministic programs
• Theory of program structures: Schemes, semantics, verification

Cited in

(6)

• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Deterministic and nondeterministic flowchart interpretations
• Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
• Semantics of algorithmic languages
• Algebraic characterization of reducible flowcharts
• Correctness of recursive parallel nondeterministic flow programs

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

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