Paper Details

%T Parallel Usage Checking \- an Observation
%A Barry M. Cook
%E Peter H. Welch, Adam T. Sampson, Jan Bækgaard Pedersen, Jon Kerridge, Jan F. Broenink, Frederick R. M. Barnes
%B Communicating Process Architectures 2011
%X One of the great strengths of CSP based concurrent
   programming languages (such as occam) is the support
   provided to the programmer in avoiding the creation of
   erroneous programs. One such support –
   <i>parallel usage checking</i>
   – detects program behaviours that may leave a
   variable in an unpredictable state. Current implementations
   of this check are safe but can lead to inefficient program
   implementations. In some cases, a simple
   program transformation can be used to demonstrate the safety
   of programs that would otherwise fail existing tests. By
   presenting a simple (but generic) example, I will show that
   using such a transformation allows the creation of
   more efficient programs.

If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.

Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.