arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.04167cs.PL
收藏

无序交互的网络类型

Mailbox Types for Unordered Interactions

Ugo de'Liguoro, Luca Padovani

摘要:

我们提出了一个类型的系统推理的协议一致性和死锁自由网络的进程,通过无序的邮箱进行通信。我们在邮箱演算中对这些网络进行建模,邮箱演算是具有第一类邮箱和选择性输入的异步π演算的温和扩展。演算包含演员模型,并允许我们分析网络的动态拓扑结构和不同数量的进程可能混合不同的并发抽象。良好类型的进程是无死锁的,永远不会因为意外消息而失败。对于其中的一个重要类别,垃圾自由也是有保证的。我们说明了表达的演算和类型系统的编码实例的非统一的,并发的对象,二进制会话扩展连接和分叉,和一些已知的演员基准。

英文摘要:

We propose a type system for reasoning on protocol conformance and deadlock freedom in networks of processes that communicate through unordered mailboxes. We model these networks in the mailbox calculus, a mild extension of the asynchronous π-calculus with first-class mailboxes and selective input. The calculus subsumes the actor model and allows us to analyze networks with dynamic topologies and varying number of processes possibly mixing different concurrency abstractions. Well-typed processes are deadlock free and never fail because of unexpected messages. For a non-trivial class of them, junk freedom is also guaranteed. We illustrate the expressiveness of the calculus and of the type system by encoding instances of non-uniform, concurrent objects, binary sessions extended with joins and forks, and some known actor benchmarks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑