Communicating sequential processes
Communicating sequential processes
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Using a PVS Embedding of CSP to Verify Authentication Protocols
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
A Corrected Failure Divergence Model for CSP in Isabelle/HOL
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
Verifying authentication protocol implementations
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
A generic theorem prover of CSP refinement
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
CSP-CASL-Prover: A Generic Tool for Process and Data Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
The Stable Revivals Model in CSP-Prover
Electronic Notes in Theoretical Computer Science (ENTCS)
Structured CSP: a process algebra as an institution
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
| Hi-index | 0.00 |
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been given in operational style. A Csp semantics in axiomatic style, however, has been considered problematic in the literature. In this paper we present a sound and complete axiomatic semantics for Csp with unbounded nondeterminism over an alphabet of arbitrary size. This result is connected in various ways with our tool Csp-Prover: (1) the Csp dialect under discussion is the input language of Csp-Prover; (2) all theorems presented have been verified with Csp-Prover; (3) Csp-Prover implements the given axiom system.