The Challenges and Triumphs of CSP Based Formal Verification

16 pages•Published: October 17, 2024

Abstract

I have spent my long career developing the CSP process algebra, with much attention going to make it usable in real-world problems. In this paper I reflect on this work and try to sum up where we are in 2024. I concentrate on some relatively recent applications including the ideas behind the Coco System and how CSP can be used to support decentralised reasoning in the presence of Byzantine behaviour. I think CSP models are the ideal starting point when you want to get to grips with a challenging issue in practical concurrency.

Keyphrases: blockchain, coco, csp, fdr, verification

In: Lindsay Quarrie (editor). Proceedings of 2024 Concurrent Processes Architectures and Embedded Systems Hybrid Virtual Conference, vol 20, pages 1-16.

Links:	https://easychair.org/publications/paper/SPpC
	https://doi.org/10.29007/bbq9

BibTeX entry

@inproceedings{COPA2024:Challenges_Triumphs_CSP_Based,
  author    = {Andrew Roscoe and Pedro Antonino},
  title     = {The Challenges and Triumphs of CSP Based Formal Verification},
  booktitle = {Proceedings of 2024 Concurrent Processes Architectures and Embedded Systems Hybrid Virtual Conference},
  editor    = {Lindsay Quarrie},
  series    = {Kalpa Publications in Computing},
  volume    = {20},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/SPpC},
  doi       = {10.29007/bbq9},
  pages     = {1-16},
  year      = {2024}}

Download PDF Open PDF in browser