A methodology for programming with concurrency: the formalism

https://doi.org/10.1016/0167-6423(82)90003-XGet rights and content
Under an Elsevier user license
open archive

Abstract

The formal theory of the methodology is developed and illustrated with one example: sorting an array of numbers into ascending order.

Cited by (0)

This research was partially supported by the Social Sciences and Humanities Research Council of Canada and the World University Service of Canada.

∗∗

Current address: Department of Computer Sciences, College of Natural Sciences, The University of Texas at Austin, Austin, TX 78712, U.S.A.