Using Pi-Calculus Names as Locks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Using Pi-Calculus Names as Locks

Résumé

Locks are a classic data structure for concurrent programming. We introduce a type system to ensure that names of the asynchronous pi-calculus are used as locks. Our calculus also features a construct to deallocate a lock once we know that it will never be acquired again. Typability guarantees two properties: deadlock-freedom, that is, no acquire operation on a lock waits forever; and leak-freedom, that is, all locks are eventually deallocated. We leverage the simplicity of our typing discipline to study the induced typed behavioural equivalence. After defining barbed equivalence, we introduce a sound labelled bisimulation, which makes it possible to establish equivalence between programs that manipulate and deallocate locks.

Dates et versions

hal-04406112 , version 1 (19-01-2024)

Identifiants

Citer

Daniel Hirschkoff, Enguerrand Prebet. Using Pi-Calculus Names as Locks. Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, EXPRESS/SOS 2023, and 20th Workshop on Structural Operational Semantics, Sep 2023, Antwerp, Belgium. pp.76--96, ⟨10.48550/arXiv.2309.07307⟩. ⟨hal-04406112⟩
10 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More