Nondeterministic flowchart programs with recursive procedures: Semantics and correctness II
- 31 December 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 13 (3) , 239-270
- https://doi.org/10.1016/s0304-3975(81)80001-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Completeness with Finite Systems of Intermediate Assertions for Recursive Program SchemesSIAM Journal on Computing, 1980
- Is “sometime” sometimes better than “always”?Communications of the ACM, 1978
- Arithmetical completeness in logics of programsPublished by Springer Nature ,1978
- Correctness of recursive flow diagram programsPublished by Springer Nature ,1977
- On the completeness of the inductive assertion methodJournal of Computer and System Sciences, 1975
- Automatic program verification I: A logical basis and its implementationActa Informatica, 1975
- Formalization of Properties of Functional ProgramsJournal of the ACM, 1970
- The correctness of nondeterministic programsArtificial Intelligence, 1970
- The correctness of programsJournal of Computer and System Sciences, 1969
- Nondeterministic AlgorithmsJournal of the ACM, 1967