%T Verification of a Dynamic Channel Model using the SPIN Model\-Checker
%A  Rune Møllegard Friborg,  Brian Vinter
%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 This paper presents the central elements of a new dynamic
   channel
leading towards a flexible CSP design suited for
   high\-level languages.
This channel is separated into three
   models: a shared\-memory channel, a
distributed channel and
   a dynamic synchronisation layer.  The models are
described
   such that they may function as a basis for implementing a
   CSP
library, though many of the common features known in
   available CSP
libraries have been excluded from the models.
   The SPIN model checker has
been used to check for the
   presence of deadlocks, livelocks, starvation,
race
   conditions and correct channel communication behaviour. The
   three
models are separately verified for a variety of
   different process
configurations. This verification is
   performed automatically by doing an
exhaustive verification
   of all possible transitions using SPIN. The
joint result of
   the models is a single dynamic channel type which
supports
   both local and distributed any\-to\-any communication. This
   model
has not been verified and the large state\-space may
   make it unsuited for
exhaustive verification using a model
   checker. An implementation of the
dynamic channel will be
   able to change the internal synchronisation
mechanisms
   on\-the\-fly, depending on the number of channel\-ends
   connected
or their location.