Paper Details

@InProceedings{FriborgVinter11,
  title = "{V}erification of a {D}ynamic {C}hannel {M}odel using the {SPIN} {M}odel-{C}hecker",
  author= "Friborg, Rune Møllegard and Vinter, Brian",
  editor= "Welch, Peter H. and Sampson, Adam T. and Pedersen, Jan Bækgaard and Kerridge, Jon and Broenink, Jan F. and Barnes, Frederick R. M.",
  pages = "35--54",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2011",
  isbn= "978-1-60750-773-4",
  year= "2011",
  month= "jun",
  abstract= "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."
}

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.