Oct. 16, 1978 to Oct. 18, 1978
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1978.11
We describe a formal theory of the total correctness of parallel programs, including such heretofore theoretically incomplete properties as safety from deadlock and starvation. We present a consistent and complete set of proof rules for the total correctness of parallel programs expressed in nondeterministic form. The proof of consistency and completeness is novel in that we show that the weakest preconditions for each correctness criterion are actually fixed-points (least or greatest) of continuous functions over the complete lattice of total predicates. We have obtained proof rule schemata which can universally be applied to least or greatest fixed points of continuous functions. Therefore, our proof rules are a priori consistent and complete once it is shown that certain weakest preconditions are extremum fixed-points. The relationship between true parallelism and nondeterminism is also discussed.
Lawrence Flon, Norihisa Suzuki, "Consistent and complete proof rules for the total correctness of parallel programs", FOCS, 1978, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1978, pp. 184-192, doi:10.1109/SFCS.1978.11