CSP-Prover

an interactive theorem prover on the process algebra CSP based on the theorem prover Isabelle

(if a menu is not displayed on the left, then click here)


News

[history]


Introduction

CSP-Prover is an interactive theorem prover dedicated to refinement proofs within the process algebra CSP. It aims specifically at proofs on infinite state systems, which may also involve infinite non-determinism.  For this reason, CSP-Prover currently focuses on the stable failures model F as the underlying denotational semantics of CSP.

Semantically, CSP-Prover offers both classical approaches to denotational semantics: the theory of complete partial orders (cpo) as well as the theory of complete metric spaces (cms). In this context the respective Fixed Point Theorems are used for two purposes: (1) to prove the existence of fixed points, and (2) to prove CSP refinement between two fixed points. CSP-Prover implements both these theories for infinite product spaces and thus is capable to deal with infinite systems of process equations.

Technically, CSP-Prover is based on the generic theorem prover Isabelle, using the logic HOL-Complex. Within this logic, the syntax as well as the semantics of CSP is encoded, i.e., CSP-Prover provides a deep encoding of CSP. The tool's architecture follows a generic approach which makes it easy to re-use large parts of the encoding for other CSP models. For instance, merely as a by-product, CSP-Prover includes also the CSP traces model T. More importantly, CSP-Prover can easily be extended to the failure-divergence model N and the various infinite traces models of CSP.

Consequently, CSP-Prover contains fundamental theorems such as fixed point theorems on cpo and cms, the definitions of CSP syntax and semantics, and many CSP-laws and semi-automatic proof tactics for verification of refinement relation. Therefore, CSP-Prover can be used for

Download  (CSP-Prover ver.5.1)

You can download CSP-Prover:              Download [User-Guide-5-1.pdf] (276KB) (last modified: 06/01/2010)
[previous versions]


Licence agreement

Following the ideas of open source software, we allow anyone to use CSP-Prover without fee, under the CSP-Prover licence, which is similar to the Lesser Gnu Public License (LGPL). You have to agree with the licence before using CSP-Prover.


Set up CSP-Prover

It is assumed that "CSP-Prover-5-1-2009-1.tar.gz" has been downloaded (see Download) and has been unpacked to the directory (or your appropriate directory):

   /user/local/CSP-Prover-5-1-2009-1

It is recommended that you make heap files CSP, CSP_T, CSP_F, FNF_F, and DFP by:
  1. Go to the directory CSP-Prover by
       cd /user/local/CSP-Prover-5-1-2009-1

  2. Execute a command by
       make_heaps
The heap files will be made in your isabelle directory. If you did not specify the directory, it is probably

   ~/.isabelle/heaps/Isabelle2009/polyml-*** (which depends on your OS)

It may take time to make the heap files. For example, 8 minutes by Intel CPU (Core2, 2.5GHz).

(Please read "User Guide CSP-Prover Ver.5.1" (see Download) for detail)


Example
a screen-shot
screenshot


Papers


Tool demonstration
  
FACCS Workshop "25 years of CSP", Southbank University London, 7 and 8 July, 2004
.



Acknowledgments

We would like to thank Christoph Lüth, Ranko Lazic, Bernd-Holger Schlingloff, and Jan Peleska for valuable feedback and advice to improve our tool.


Support

This joint project between AIST(Japan) and UWS(UK) is supported by the Royal Society Grants (Ref: NC/SV/Japan/isobe 15418 and an international outgoing short visit)


Links


Contact


Last modified: 11 June 2013
(since 28/01/2005)