Paper Details

How to Design Deadlock-Free Networks Using CSP and Verification Tools -- A Tutorial Introduction

Authors: Martin, Jeremy M. R., Jassim, S. A.

Abstract:

The CSP language of C.A.R. Hoare originated as a blackboard mathematical notation for specifying and reasoning about parallel and distributed systems. More recently sophisticated tools have emerged which provide automated verification of CSP-specified systems. This has led to a tightening and standardisation of syntax. This paper outlines the syntax and semantics of CSp as it is now used and then describes how to design CSP networks, which are guaranteed to be free of deadlock, throught a succession of increasingly complex worked examples, making use of the verification tool Deadlock Checker.

Proceedings:

Proceedings of WoTUG-20: Parallel Programming and Java, André W. P. Bakkers, 1997, pp 326 - 338 published by IOS Press, Amsterdam

Files: PDF, PS

This record in other formats:

Web page: BibTEX, Refer
Plain text: BibTEX, Refer

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.