Ilaria Castellani, Mariangiola Dezani-Ciancaglini, Paola Giannini
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We study an urgent semantics of asynchronous timed session types, where input actions happen as soon as possible. We show that with this semantics we can recover to the timed setting an appealing property of untimed session types: namely, deadlock-freedom is preserved when passing from synchronous to asynchronous communication.
Global types and event structure semantics for asynchronous multiparty sessions
本文提出将异步通信的多方会话解释为流事件结构，并引入新的全局类型概念，确保会话的预期属性，如进展。全局类型通过更直接地反映异步性并更宽松地解释为原始事件结构。
Partial Typing for Asynchronous Multiparty Sessions
本文针对并发系统验证难以局部化的问题，提出异步多方会话的部分类型指派系统，并证明其可类型性保证部分锁自由与孤儿消息自由。
This paper presents the first formalisation of the precise subtyping relation for asynchronous multiparty sessions. We show that our subtyping relation is sound (i.e., guarantees safe process replacement) and also complete: any extension of the relation is unsound. To achieve our results, we develop a novel session decomposition technique, from full session types (including internal/external choices) into single input/output session trees (without choices). Previous work studies precise subtyping for binary sessions (with just two participants), or multiparty sessions (with any number of parti…
On Asynchronous Multiparty Session Types for Federated Learning
本文改进了会话类型理论，以支持建模和验证实现联邦学习协议的过程。通过引入面向多个参与者的输入/输出操作，增强了灵活性并允许安全的过程替换。
We present Concurrent GV (CGV), a functional calculus with message-passing concurrency governed by session types. With respect to prior calculi, CGV has increased support for concurrent evaluation and for cyclic network topologies. The design of CGV draws on APCP, a session-typed asynchronous pi-calculus developed in prior work. Technical contributions are (i) the syntax, semantics, and type system of CGV; (ii) a correct translation of CGV into APCP; (iii) a technique for establishing deadlock-free CGV programs, by resorting to APCP's priority-based type system.
Timeout Asynchronous Session Types: Safe Asynchronous Mixed-Choice For Timed Interactions
本文提出 TOAST，通过时间约束安全支持异步会话类型中的混合选择，并给出具备进程计时器、可建模 receive-after 超时模式的演算及主体归约证明。
We present Concurrent GV (CGV), a functional calculus with message-passing concurrency governed by session types. With respect to prior calculi, CGV has increased support for concurrent evaluation and for cyclic network topologies. The design of CGV draws on APCP, a session-typed asynchronous pi-calculus developed in prior work. Technical contributions are (i) the syntax, semantics, and type system of CGV; (ii) a correct translation of CGV into APCP; (iii) a technique for establishing deadlock-free CGV programs, by resorting to APCP's priority-based type system.
Asynchronous Multiparty Sessions with Mixed Choice
本文提出一种异步多方会话的校验算法，支持输入和输出前缀的非确定性选择，通过全局类型系统确保通信标签集的连贯性，证明了类型正确性和会话保真性，展示了混合选择在异步多方协议中的表达力。
Asynchronous Session-Based Concurrency: Deadlock-freedom in Cyclic Process Networks
本文提出支持异步通信和递归的会话类型框架 APCP 以确保循环进程网络的无死锁性，并设计新并发 λ-演算 LASTn，通过满足操作对应的翻译将无死锁保证从 APCP 转移到 LASTn。
Subtyping in concurrency has been extensively studied since early 1990s as one of the most interesting issues in type theory. The correctness of subtyping relations has been usually provided as the soundness for type safety. The converse direction, the completeness, has been largely ignored in spite of its usefulness to define the largest subtyping relation ensuring type safety. This paper formalises preciseness (i.e. both soundness and completeness) of subtyping for mobile processes and studies it for the synchronous and the asynchronous session calculi. We first prove that the well-known ses…
A Gentle Overview of Asynchronous Session-based Concurrency: Deadlock Freedom by Typing
本文综述基于会话的异步并发领域研究，介绍三种带类型进程框架，阐述其如何为循环进程网络中异步通信的消息传递进程及带会话的并发函数式语言保障无死锁特性。
Deconfined Global Types for Asynchronous Sessions
本文提出一种改进的异步多参与者会话类型系统，在满足良构条件时保留主体归约、会话保真和进展性质，并配有健全完备的类型推断算法，通过检查良构条件的受限形式恢复类型化的有效性。
Fair Asynchronous Session Subtyping
本文研究异步会话类型中相对于无限消息消费提前发送消息的问题，提出基于公平合规性和可控性的新型公平异步会话子类型，证明其不可判定性，给出可靠算法及其实证评估。
Fair Termination of Asynchronous Binary Sessions
本文提出基于线性逻辑的异步会话类型理论，利用新颖的公平异步子类型关系保证良类型进程在公平性假设下公平终止，实现无饥饿与无孤儿消息。
A Session Type System for Asynchronous Unreliable Broadcast Communication
本文提出不可靠广播会话演算及其会话类型系统，刻画广播与汇聚的对偶会话类型，并提供无需确认的自主恢复机制，通过实现Paxos协议验证了框架的表达能力。
A Logical Interpretation of Asynchronous Multiparty Compatibility
本文在命题即类型框架下将多方兼容性的相干性条件推广为转发器，并证明转发器完全刻画所有类型良好的多方兼容进程。
Correctly Communicating Software: Distributed, Asynchronous, and Beyond (extended version)
本论文以会话类型的逻辑基础为核心，研究如何在保证正确性的前提下扩展二元与多方会话类型的表达力及适用范围，以支撑分布式异步消息传递软件的可靠验证。
Crash-Stop Failures in Asynchronous Multiparty Session Types
针对现实分布式系统中的崩溃故障，提出一种带崩溃停止语义的异步多参与方会话类型理论，通过崩溃处理分支和可选可靠性假设，保证良类型进程的无死锁、协议一致性与活性。
Actris 2.0: Asynchronous Session-Type Based Reasoning in Separation Logic
本文提出Actris 2.0，一种基于会话类型的分离逻辑，用于在混合并发范式下证明消息传递程序的功能正确性，并通过子协议增强异步推理，已在Coq中机械化验证。
We present a system of session types based on adjoint logic which generalize standard binary session types. Our system allows us to uniformly capture several new behaviors in the space of asynchronous message-passing communication, including multicast, where a process sends a single message to multiple clients, replicable services, which have multiple clients and replicate themselves on-demand to handle requests from those clients, and cancellation, where a process discards a channel without communicating along it. We provide session fidelity and deadlock-freedom results for this system, from …
Behavioural type systems ensure more than the usual safety guarantees of static analysis. They are based on the idea of "types-as-processes", providing dedicated type algebras for particular properties, ranging from protocol compatibility to race-freedom, lock-freedom, or even responsiveness. Two successful, although rather different, approaches, are session types and process types. The former allows to specify and verify (distributed) communication protocols using specific type (proof) systems; the latter allows to infer from a system specification a process abstraction on which it is simpler…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。