The Challenges and Triumphs of CSP Based Formal Verification
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.
Authors
- Pedro Antonino (ORCID: https://orcid.org/0000-0002-5627-0910)
- Andrew Roscoe (ORCID: https://orcid.org/0000-0003-1108-4265)
Publication Details
- Journal
- Kalpa publications in computing
- Published
- 2024-10-17
- DOI
- https://doi.org/10.29007/bbq9
- Primary Topic
- Formal Methods in Verification
- Type
- article
- Field-Weighted Citation Impact
- 0.00