PVS Embedding of cCSP Semantic Models and Their Relationship

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.

[1]  Myla Archer,et al.  Human-Style Theorem Proving Using PVS , 1997, TPHOLs.

[2]  Christine Paulin-Mohring,et al.  The coq proof assistant reference manual , 2000 .

[3]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[4]  Albert John Camilleri.  Mechanizing CSP Trace Theory in Higher Order Logic , 1990, IEEE Trans. Software Eng..

[5]  Steve A. Schneider,et al.  Using a PVS Embedding of CSP to Verify Authentication Protocols , 1997, TPHOLs.

[6]  Owre Sam,et al.  Abstract Datatypes in PVS , 1997 .

[7]  Natarajan Shankar,et al.  PVS: A Prototype Verification System , 1992, CADE.

[8]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[9]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[10]  Shamim Ripon,et al.  Extending and relating semantic models of compensating CSP , 2008 .

[11]  Shamim Ripon,et al.  Relating Semantic Models of Compensating CSP , 2006 .

[12]  Jan Tijmen Udding,et al.  Algebraic Proof Assistants in HOL , 1995, MPC.

[13]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[14]  Martin Wirsing,et al.  Extraction of Structured Programs from Specification Proofs , 1999, WADT.

[15]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

[16]  Richard J. Boulton,et al.  Experience with Embedding Hardware Description Languages in HOL , 1992, TPCD.

[17]  Jozef Hooman,et al.  Process Algebra in PVS , 1999, TACAS.

[18]  Shamim Ripon,et al.  Executable Semantics for Compensating CSP , 2005, EPEW/WS-FM.

[19]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[20]  Neil Evans,et al.  Verifying security protocols with PVS: widening the rank function approach , 2005, J. Log. Algebraic Methods Program..

[21]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .

[22]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[23]  Natarajan Shankar,et al.  Principles and Pragmatics of Subtyping in PVS , 1999, WADT.

[24]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .