Communicating sequential processes
Communicating sequential processes
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Relating CASL with other specification languages: the institution level
Theoretical Computer Science
Verification of a sliding window protocol in μCRL and PVS
Formal Aspects of Computing
CSP-CASL: a new integration of process algebra and algebraic specification
Theoretical Computer Science - Algebraic methods in language processing
Structured CSP: a process algebra as an institution
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
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
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
Compositional modelling and reasoning in an institution for processes and data
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
| Hi-index | 0.00 |
The specification language Csp-Casl allows one to model processes as well as data of distributed systems within one framework. In our paper, we describe how a combination of the existing tools Hets and Csp-Prover can solve the challenges that Csp-Casl raises on integrated theorem proving for processes and data. For building this new tool, the automated generation of theorems and their proofs in Isabelle/HOL plays a fundamental role. A case study of industrial strength demonstrates that our approach scales up to complex problems.