Asynchronous Sessions with Input Races
Ilaria Castellani (INRIA, Universit\'e C\^ote d'Azur), Mariangiola, Dezani-Ciancaglini (Universit\`a di Torino), Paola Giannini (Universit\`a del, Piemonte Orientale)
TL;DR
This paper introduces a calculus for asynchronous multiparty sessions that allows input races from different senders, along with a type system ensuring these races do not compromise lock-freedom.
Contribution
It presents a novel calculus and type system for asynchronous sessions with input races, ensuring lock-freedom is maintained.
Findings
The calculus models asynchronous multiparty communication with input races.
The type system guarantees lock-freedom despite input races.
Input races are permissible if they do not hinder lock-freedom.
Abstract
We propose a calculus for asynchronous multiparty sessions where input choices with different senders are allowed in processes. We present a type system that accepts such input races provided they do not hinder lock-freedom.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.