Communicating sequential processes
Communicating sequential processes
Mechanizing CSP Trace Theory in Higher Order Logic
IEEE Transactions on Software Engineering
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
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Responsiveness of interoperating components
Formal Aspects of Computing
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
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
A complete axiomatic semantics for the CSP stable-failures model
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Embedding the stable failures model of CSP in PVS
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
| Hi-index | 0.00 |
The stable revivals model R provides a new semantic framework for the process algebra Csp. The model R has recently been added to the realm of established Csp models. Within the Csp context, it enhances the analysis of systems with regards to properties such as responsiveness and stuckness. These properties are essential in component based system design. In this paper we report on the implementation of different variants of the model R within Csp-Prover. Based on Isabelle/HOL, Csp-Prover is an interactive proof tool for Csp refinement, which is generic in the underlying Csp model. On the practical side, our encoding of the model R provides semi-automatic proof support for reasoning on responsiveness and stuckness. On the theoretical side, our implementation also yields a machine verification of the model R's soundness as well as of its expected properties.