Communicating sequential processes
Communicating sequential processes
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Handbook of Process Algebra
Deadlock Analysis for a Fault-Tolerant System
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Combining Methods for the Livelock Analysis of a Fault-Tolerant System
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
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
Combining Interaction and Automation in Process Algebra Verification
TAPSOFT '91 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD)
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
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Algebraic Proof Assistants in HOL
MPC '95 Mathematics of Program Construction
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
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
Handbook of automated reasoning
CSP-CASL: a new integration of process algebra and algebraic specification
Theoretical Computer Science - Algebraic methods in language processing
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
Towards a formal specification of an electronic payment system in CSP-CASL
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
CSP-CASL: a new integration of process algebra and algebraic specification
Theoretical Computer Science - Algebraic methods in language processing
Automated refinement checking of concurrent systems
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Generic Tools via General Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Probing the Depths of CSP-M: A New fdr-Compliant Validation Tool
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Electronic Notes in Theoretical Computer Science (ENTCS)
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)
Compositional Verification of Input-Output Conformance via CSP Refinement Checking
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Translation validation of high-level synthesis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An approach for machine-assisted verification of Timed CSP specifications
Innovations in Systems and Software Engineering
LLVM2CSP: extracting csp models from concurrent programs
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Simulating truly concurrent CSP
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
A CSP-based framework for the specification, verification, and implementation of adaptive systems
Proceedings of the 6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems
A novel architecture for Web service composition
Journal of Network and Computer Applications
Towards a formal specification of an electronic payment system in CSP-CASL
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
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
Failure-divergence semantics and refinement of long running transactions
Theoretical Computer Science
| Hi-index | 0.00 |
We describe a new tool called Csp-Prover which is an interactive theorem prover dedicated to refinement proofs within the process algebra Csp. It aims specifically at proofs for infinite state systems, which may also involve infinite non-determinism. Semantically, Csp-Prover supports both the theory of complete metric spaces as well as the theory of complete partial orders. Both these theories are implemented for infinite product spaces. Technically, Csp-Prover is based on the theorem prover Isabelle. It provides a deep encoding of Csp. The tool's architecture follows a generic approach which makes it easy to adapt it for various Csp models besides those studied here: the stable failures model $\mathcal{F}$ and the traces model $\mathcal{T}$.