Paper Details

A Tool for Proving Deadlock Freedom

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

Abstract:

We describe a tool, programmed in Java, for the formal verification of the absence of deadlock and livelock in networks of CSP processes. The innovative techniques used scale well to very large networks, unlike the exhaustive state checking method employed by existing tools.

Proceedings:

Proceedings of WoTUG-20: Parallel Programming and Java, André W. P. Bakkers, 1997, pp 1 - 16 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.