Fair Asynchronous Session Subtyping
Session types are widely used as abstractions of asynchronous message passing systems. Refinement for such abstractions is crucial as it allows improvements of a given component without compromising its compatibility with the rest of the system. In the context of session types, the most general noti...
Uloženo v:
| Vydáno v: | Logical methods in computer science Ročník 20, Issue 4 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Logical Methods in Computer Science e.V
01.10.2024
|
| Témata: | |
| ISSN: | 1860-5974, 1860-5974 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Session types are widely used as abstractions of asynchronous message passing
systems. Refinement for such abstractions is crucial as it allows improvements
of a given component without compromising its compatibility with the rest of
the system. In the context of session types, the most general notion of
refinement is asynchronous session subtyping, which allows message emissions to
be anticipated w.r.t. a bounded amount of message consumptions. In this paper
we investigate the possibility to anticipate emissions w.r.t. an unbounded
amount of consumptions: to this aim we propose to consider fair compliance over
asynchronous session types and fair refinement as the relation that preserves
it. This allows us to propose a novel variant of session subtyping that
leverages the notion of controllability from service contract theory and that
is a sound characterisation of fair refinement. In addition, we show that both
fair refinement and our novel subtyping are undecidable. We also present a
sound algorithm which deals with examples that feature potentially unbounded
buffering. Finally, we present an implementation of our algorithm and an
empirical evaluation of it on synthetic benchmarks. |
|---|---|
| ISSN: | 1860-5974 1860-5974 |
| DOI: | 10.46298/lmcs-20(4:5)2024 |