Dardha, O. and Pérez, J. A. (2022) Comparing type systems for deadlock freedom. Journal of Logical and Algebraic Methods in Programming, 124, 100717. (doi: 10.1016/j.jlamp.2021.100717)
![[img]](https://eprints.gla.ac.uk/style/images/fileicons/text.png) |
Text
262401.pdf - Published Version Available under License Creative Commons Attribution. 1MB |
Abstract
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 classical 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.
| Item Type: | Articles |
|---|---|
| Additional Information: | This work was partially supported by the EU COST Action IC1201 (Behavioural Types for Reliable Large-Scale Software Systems). Dardha has been supported by the UK EPSRC project EP/K034413/1 (From Data Types to Session Types: A Basis for Concurrency and Distribution) and by the EU Horizon 2020 MSCA RISE project 778233 “Behavioural Application Program Interfaces” (BehAPI). Pérez has been partially supported by the Dutch Research Council (NWO) under project No. 016.Vidi.189.046 (Unifying Correctness for Communicating Software). Pérez is also affiliated to the NOVA Laboratory for Computer Science and Informatics, Universidade Nova de Lisboa, Portugal. |
| Status: | Published |
| Refereed: | Yes |
| Glasgow Author(s) Enlighten ID: | Dardha, Dr Ornela |
| Authors: | Dardha, O., and Pérez, J. A. |
| College/School: | College of Science and Engineering > School of Computing Science |
| Journal Name: | Journal of Logical and Algebraic Methods in Programming |
| Publisher: | Elsevier |
| ISSN: | 2352-2208 |
| ISSN (Online): | 2352-2216 |
| Published Online: | 10 September 2021 |
| Copyright Holders: | Copyright © 2021 The Authors |
| First Published: | First published in Journal of Logical and Algebraic Methods in Programming 124: 100717 |
| Publisher Policy: | Reproduced under a Creative Commons License |
University Staff: Request a correction | Enlighten Editors: Update this record
Funder and Project Information
Funder and Project Information