The HOL-CSP Refinement Toolkit - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Archive of Formal Proofs Année : 2020

The HOL-CSP Refinement Toolkit

Résumé

We use a formal development for CSP, called HOL-CSP2.0, to analyse a family of refinement notions, comprising classic and new ones. This analysis enables to derive a number of properties that allow to deepen the understanding of these notions, in particular with respect to specification decomposition principles for the case of infinite sets of events. The established relations between the refinement relations help to clarify some obscure points in the CSP literature, but also provide a weapon for shorter refinement proofs. Furthermore, we provide a framework for state-normalisation allowing to formally reason on parameterised process architectures. As a result, we have a modern environment for formal proofs of concurrent systems that allow for the combination of general infinite processes with locally finite ones in a logically safe way. We demonstrate these verification-techniques for classical, generalised examples: The CopyBuffer for arbitrary data and the Dijkstra's Dining Philosopher Problem of arbitrary size.
Fichier non déposé

Dates et versions

hal-04503821 , version 1 (13-03-2024)

Licence

Domaine public

Identifiants

  • HAL Id : hal-04503821 , version 1

Citer

Safouan Taha, Burkhart Wolff, Lina Ye. The HOL-CSP Refinement Toolkit. Archive of Formal Proofs, 2020, https://www.isa-afp.org/entries/CSP_RefTK.html#cite-popup. ⟨hal-04503821⟩
0 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More