Session Types Revisited: A Decade Later

Dardha, Ornela; Giachino, Elena; Sangiorgi, Davide

doi:10.1145/3551357.3556676

Search citation statements

Order By: Relevance

Paper Sections

Select...

Ccsℓ: Ensuring Deadlock-freedom Using Composition1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After that interaction, the release on ℓ contained in Q is inert, in the sense that no acquire can synchronise with it. We believe that this form of linearity can be used to encode binary session types in an extended version of πℓ, including variants and polyadicity, along the lines of [14,3,4].…”

Section: Ccsℓ: Ensuring Deadlock-freedom Using Compositionmentioning

confidence: 99%

Using Pi-Calculus Names as Locks

Hirschkoff,

Prebet

2023

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Locks are a classic data structure for concurrent programming. We introduce a type system to ensure that names of the asynchronous π-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. P dl def = ℓ 1 (x). (ℓ 1 x | ℓ 2 x ) | ℓ 2 (y). (ℓ 1 y | ℓ 2 y ).

show abstract

Section: Ccsℓ: Ensuring Deadlock-freedom Using Compositionmentioning

confidence: 99%