Paper Details

%T Verification of JCSP Programs
%A Vladimir Klebanov, Philipp Rümmer, Steffen Schlager, Peter H. Schmitt
%E Jan F. Broenink, Herman Roebbers, Johan P. E. Sunter, Peter H. Welch, David C. Wood
%B Communicating Process Architectures 2005
%X We describe the first proof system for concurrent programs
   based on Communicating Sequential Processes for Java (JCSP).
   The system extends a complete calculus for the JavaCard
   Dynamic Logic with support for JCSP, which is modeled in
   terms of the CSP process algebra. Together with a novel
   efficient calculus for CSP, a rule system is obtained that
   enables JCSP programs to be executed symbolically and to be
   checked against temporal properties. The proof system has
   been implemented within the KeY tool and is publicly
   available.

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.