Synchronised Shared Memory and Model Checking - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Embedded Computing Systems (TECS) Année : 2023

Synchronised Shared Memory and Model Checking

Résumé

In this paper, a formal generic framework for defining and reasoning about deterministic concurrency in synchronous systems is implemented in the Spin model checker. Concretely, the paper implements the clock-synchronised shared memory ( csm ) theory , which extends synchronous programming with more and higher level csm data types. These csm data types are equipped with a synchronisation policy prescribing how concurrent calls to objects methods must be organised. In a policy constructive system, all methods of every object can be scheduled in a policy-conformant manner without deadlocking. In our framework, synchronous policies get codified as Promela never-claims. In this form, the model checker can search for executions (interleavings) that satisfy the synchronous product of all the never-claims, namely policy-conformant schedules for all the csm objects. The existence of such a policy-conformant schedules, verifies that the concurrent synchronous system is deterministic. The approach of this paper extends beyond a single semantics since it can handle the synchronous programming model as well as the various forms of the sequentially constructive model found in the literature.

Dates et versions

hal-04400956 , version 1 (17-01-2024)

Identifiants

Citer

Joaquín Aguado, Alejandra Duenas. Synchronised Shared Memory and Model Checking. ACM Transactions on Embedded Computing Systems (TECS), 2023, pp.1-30. ⟨10.1145/3626188⟩. ⟨hal-04400956⟩
12 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More