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

无死锁的比较型系统

Comparing Type Systems for Deadlock Freedom

Ornela Dardha, Jorge A. Pérez

摘要:

消息传递软件系统表现出非平凡形式的并发性和分布;它们被期望在通信服务之间遵循预期的协议,但也永远不会“卡住”。这种直观的需求已经通过诸如进程或(死)锁自由的活动属性来表达,并且各种类型的系统确保并发进程具有这些属性。不幸的是,很少有人知道这些类型系统和它们诱导的类型化进程类之间的精确关系。本文首次对保证无死锁的消息传递进程的不同类型系统进行了比较研究。我们比较了两类无死锁类型进程,这里记为L和K。类L因其规范性而突出:它是从线性逻辑命题作为会话类型的Curry-Howard解释中产生的。通过将会话类型编码为具有用法的Kobayashi线性类型而获得的类K包括在其他类型系统中不可类型化的进程。我们表明,L是严格包括在K,并确定精确的条件下,他们一致。我们还提供了两个保持类型的翻译过程在K到过程在L。

英文摘要:

Message-passing software systems exhibit non-trivial forms of concurrency and distribution; they are expected to follow intended protocols among communicating services, but also to never "get stuck". This intuitive requirement has been expressed by liveness properties such as progress or (dead)lock freedom and various type systems ensure these properties for concurrent processes. Unfortunately, very little is known about the precise relationship between these type systems and the classes of typed processes they induce. This paper puts forward the first comparative study of different type systems for message-passing processes that guarantee deadlock freedom. We compare two classes of deadlock-free typed processes, here denoted L and K. The class L stands out for its canonicity: it results from Curry-Howard interpretations of linear logic propositions as session types. The class K, obtained by encoding session types into Kobayashi's linear types with usages, includes processes not typable in other type systems. We show that L is strictly included in K, and identify the precise conditions under which they coincide. We also provide two type-preserving translations of processes in K into processes in L.

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

↑