Abstract
For many purposes, asynchronous parallel programs may be viewed as sequential but nondeterministic programs. The direct translation to nondeterministic sequential form leads to a combinatorial explosion of program size before correctness proofs can even begin. The Church-Rosser approach to correctness of asynchronous parallel programs is a flexible way to divide a correctness proof into several lemmas, no one of which requires both deep reasoning and explicit enumeration of all the control states required in the nondeterministic sequential form of the program. The approach is stated and justified abstractly, demonstrated in detail for a simple example program, and compared with other approaches to the correctness of parallel programs. The abstract formulation is independent of the model of parallelism in the example and can also be applied to nondeterminism not derived from asynchronous parallelism. We conclude with a survey of prospects for computer assisted proofs structured by the Church-Rosser approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
