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

优先考虑最佳变体

Prioritise the Best Variation

Wen Kokke, Ornela Dardha

AI总结:

本文提出了 Priority GV (PGV),通过解耦通道创建与线程生成并引入优先级机制,实现了对环状结构进程的无死锁类型化,并证明了其类型系统的可靠性及从 PCP 到 PGV 编码的完备性。

摘要:

二元会话类型保证了通信安全和会话保真,但仅靠它们无法排除由不同会话交错引起的死锁。在 Classical Processes (CP)——一种基于经典线性逻辑的进程演算——中,通过在同一逻辑切割规则下结合通道创建和并行组合来保证无死锁。类似地,在 Good Variation (GV)——一种线性并发 λ 演算——中,通过在同一操作(称为 fork)下结合通道创建和线程生成来保证无死锁。在 CP 和 GV 中,无死锁是以牺牲表达能力为代价的,因为唯一允许的进程是树状结构的。Dardha 和 Gay 定义了 Priority CP (PCP),它允许环状结构的进程,并通过使用优先级来恢复无死锁,这与 Kobayashi 和 Padovani 的方法一致。遵循 PCP,我们提出了 Priority GV (PGV),这是 GV 的一个变体,它将通道创建与线程生成解耦。因此,我们对环状结构进程进行类型化,并通过使用优先级来恢复无死锁。我们通过证明主体归约和进展性来表明我们的类型系统是可靠的。我们定义了从 PCP 到 PGV 的编码,并证明该编码保留了类型化,并且在操作语义方面是可靠且完备的。

英文摘要:

Binary session types guarantee communication safety and session fidelity, but alone they cannot rule out deadlocks arising from the interleaving of different sessions. In Classical Processes (CP)$-$a process calculus based on classical linear logic$-$deadlock freedom is guaranteed by combining channel creation and parallel composition under the same logical cut rule. Similarly, in Good Variation (GV)$-$a linear concurrent $λ$-calculus$-$deadlock freedom is guaranteed by combining channel creation and thread spawning under the same operation, called fork. In both CP and GV, deadlock freedom is achieved at the expense of expressivity, as the only processes allowed are tree-structured. Dardha and Gay define Priority CP (PCP), which allows cyclic-structured processes and restores deadlock freedom by using priorities, in line with Kobayashi and Padovani. Following PCP, we present Priority GV (PGV), a variant of GV which decouples channel creation from thread spawning. Consequently, we type cyclic-structured processes and restore deadlock freedom by using priorities. We show that our type system is sound by proving subject reduction and progress. We define an encoding from PCP to PGV and prove that the encoding preserves typing and is sound and complete with respect to the operational semantics.

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

↑