Paper Details

%T A Tool for Proving Deadlock Freedom
%A Jeremy M. R. Martin, S. A. Jassim
%E André W. P. Bakkers
%B Proceedings of WoTUG\-20: Parallel Programming and Java
%X 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.

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.