Communicating sequential processes
Communicating sequential processes
Mechanizing CSP Trace Theory in Higher Order Logic
IEEE Transactions on Software Engineering
Process algebra
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Principles and Pragmatics of Subtyping in PVS
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Experience with Embedding Hardware Description Languages in HOL
Proceedings of the IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience
Human-Style Theorem Proving Using PVS
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
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
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
Executable semantics for compensating CSP
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Process algebraic support for web service composition
ACM SIGSOFT Software Engineering Notes
An extended cCSP with stable failures semantics
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Failure-divergence refinement of compensating communicating processes
FM'11 Proceedings of the 17th international conference on Formal methods
Failure-divergence semantics and refinement of long running transactions
Theoretical Computer Science
| Hi-index | 0.00 |
This paper demonstrates an embedding of the semantic models of the cCSP process algebra in the general purpose theorem prover PVS. cCSP is a language designed to model long-running business transactions with constructs for orchestration of compensations. The cCSP process algebra terms are defined in PVS by using mutually recursive datatype. The trace and the operational semantics of the algebra are embedded in PVS. We show how these semantic embeddings are used to define and prove a relationship between the semantic models by using the powerful induction mechanism of PVS.