Index Terms
Corrigendum: “A New Approach to Proving the Correctness of Multiprocess Programs”
Recommendations
A New Approach to Proving the Correctness of Multiprocess Programs
A new, nonassertional approach to proving multiprocess program correctness is described by proving the correctness of a new algorithm to solve the mutual exclusion problem. The algorithm is an improved version of the bakery algorithm. It is specified ...
Proving the Correctness of Multiprocess Programs
The inductive assertion method is generalized to permit formal, machine-verifiable proofs of correctness for multiprocess programs. Individual processes are represented by ordinary flowcharts, and no special synchronization mechanisms are assumed, so ...
The current state of proving programs correct
ACM '72: Proceedings of the ACM annual conference - Volume 1Presented are successful efforts in proving that computer programs are correct. Included are (i) the methods used, (ii) the wide class of programs (including systems programs) that have been proved, and (iii) implemented computer systems for ...






Comments