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

https://doi.org/10.1016/S0304-3975(81)80001-1Get rights and content
Under an Elsevier user license
open archive

Abstract

In the second part of this work, we formulate a new inductive assertion method applying to the class of nondeterministic flowchart programs with recursive procedures studied in part 1. Using results on unfolding proved in part 1, we prove that this method is sound and complete with a finite number of assertions. We study four notions of correctness: two notions of partial correctness (existential and universal) and the corresponding notions of total correctness. We also formalize two notions of extension and equivalence (existential and universal) in the second-order predicate calculus.

Cited by (0)

*

This research was supported by the National Science Foundation under Grant No. DCR-74-15901 and MCS-77-11360.