Comparing type systems for deadlock freedom
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...
Uloženo v:
| Vydáno v: | Journal of logical and algebraic methods in programming Ročník 124; s. 100717 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
01.01.2022
|
| Témata: | |
| ISSN: | 2352-2208 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| 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. |
|---|---|
| AbstractList | 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. |
| ArticleNumber | 100717 |
| Author | Pérez, Jorge A. Dardha, Ornela |
| Author_xml | – sequence: 1 givenname: Ornela orcidid: 0000-0001-9927-7875 surname: Dardha fullname: Dardha, Ornela email: Ornela.Dardha@glasgow.ac.uk organization: School of Computing Science, University of Glasgow, UK – sequence: 2 givenname: Jorge A. orcidid: 0000-0002-1452-6180 surname: Pérez fullname: Pérez, Jorge A. email: j.a.perez@rug.nl organization: University of Groningen, the Netherlands |
| BookMark | eNp9j01LxDAQhnNYwXXdX-Cld2nNJN02OXiQ4hcseNFzSJOJpLZNSYrQf2_X9expYJhn3ve5IpsxjEjIDdACKFR3XdH1epgKRhmsG1pDvSFbxg8sZ4yKS7JPqaN0PRW14LAlt00YJh39-JnNy4RZWtKMQ8pciJlFbftgvjIXEW0YrsmF033C_d_ckY-nx_fmJT--Pb82D8fcMCnmnAnHbck0FZWjlQQ0XIIUNecSD5Zb50DqUrQU6raSQiIwbC2acs0rW-n4jvDzXxNDShGdmqIfdFwUUHXSVJ361VQnTXXWXKn7M4VrtW-PUSXjcTRofUQzKxv8v_wPDgpfhA |
| Cites_doi | 10.1016/0890-5401(92)90008-4 10.1145/330249.330251 10.1017/S0960129514000280 10.1016/j.ic.2010.05.002 10.1016/j.ic.2014.08.001 10.1016/S0890-5401(02)93171-8 10.1016/j.ic.2012.05.002 10.1007/s00236-005-0177-z 10.1016/j.ic.2016.03.004 10.1016/S0304-3975(03)00325-6 10.1145/3290337 10.1016/j.ic.2017.06.002 10.1145/3473567 10.1016/j.entcs.2008.04.011 10.1007/s002360050124 10.1017/S0960129514000218 10.1017/S0960129514000279 10.1145/1745312.1745313 |
| ContentType | Journal Article |
| Copyright | 2021 The Author(s) |
| Copyright_xml | – notice: 2021 The Author(s) |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.jlamp.2021.100717 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_jlamp_2021_100717 S2352220821000808 |
| GroupedDBID | --M 0R~ 4.4 457 4G. 6I. 7-5 8P~ AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAXUO AAYFN ABBOA ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFS ACRLP ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BKOJK BLXMC EBS EFJIC EFLBG EJD FDB FIRID FYGXN GBLVA GBOLZ HZ~ KOM M41 NCXOZ O9- OAUVE RIG ROL SPC SPCBC SSV SSZ T5K ~G- AATTM AAXKI AAYWO AAYXX ABJNI ACLOT ACVFH ADCNI ADVLN AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU CITATION EFKBS |
| ID | FETCH-LOGICAL-c298t-28f3d42a086f0691ec391987339e5d3dff19a48b017b6989e12ebdec4dea4b9f3 |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000703502400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2352-2208 |
| IngestDate | Thu Nov 13 04:22:33 EST 2025 Fri Feb 23 02:45:02 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Linear logic Linear types Deadlock freedom Session types Concurrency Process calculi |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c298t-28f3d42a086f0691ec391987339e5d3dff19a48b017b6989e12ebdec4dea4b9f3 |
| ORCID | 0000-0001-9927-7875 0000-0002-1452-6180 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.jlamp.2021.100717 |
| ParticipantIDs | crossref_primary_10_1016_j_jlamp_2021_100717 elsevier_sciencedirect_doi_10_1016_j_jlamp_2021_100717 |
| PublicationCentury | 2000 |
| PublicationDate | January 2022 2022-01-00 |
| PublicationDateYYYYMMDD | 2022-01-01 |
| PublicationDate_xml | – month: 01 year: 2022 text: January 2022 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of logical and algebraic methods in programming |
| PublicationYear | 2022 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Gay, Hole (br0230) Nov 2005; 42 Kokke, Dardha (br0310) 2021 Abramsky, Gay, Nagarajan (br0010) 1997; vol. 1281 Igarashi, Kobayashi (br0300) 2004; 311 Fowler, Kokke, Dardha, Lindley, Morris (br0220) 2021; vol. 203 Kobayashi, Pierce, Turner (br0400) 1999; 21 Torres Vieira, Thudichum Vasconcelos (br0590) 2013; vol. 7890 Honda (br0280) 1993; vol. 715 Dardha, Giachino, Sangiorgi (br0180) 2017; 256 Sangiorgi, Walker (br0530) 2001 Milner (br0430) 1991 Gorla, Nestmann (br0250) 2016; 26 Dardha, Giachino, Sangiorgi (br0170) 2012 Dardha, Pérez (br0190) 2015; vol. 190 Boreale, Sangiorgi (br0040) 1998; 35 Dardha (br0140) 2016; vol. 7 Kobayashi (br0360) 2002; 177 Giachino, Kobayashi, Laneve (br0240) 2014 Dardha, Pérez (br0200) 2020 Kobayashi (br0620) 2002; vol. 2757 Bettini, Coppo, D'Antoni, De Luca, Dezani-Ciancaglini, Yoshida (br0030) 2008 Qian, Kavvos, Birkedal (br0510) 2021; 5 Kokke, Dardha (br0320) 2021; vol. 12719 Parrow (br0480) 2016; 26 Yoshida (br0610) 1996; vol. 1180 Toninho, Caires, Pfenning (br0540) 2014; vol. 8902 Takeuchi, Honda, Kubo (br0550) 1994 Francalanza, Giunti, Ravara (br0210) 2015; vol. 188 Kobayashi, Pierce, Turner (br0390) 1996 van den Heuvel, Pérez (br0570) 2020; vol. 314 Caires, Pfenning, Toninho (br0110) 2016; 26 Carbone, Dardha, Montesi (br0080) 2014; vol. 8459 Padovani (br0460) 2014 Caires (br0060) September 2014 Dezani-Ciancaglini, de'Liguoro, Yoshida (br0150) 2008; vol. 4912 Milner, Parrow, Walker (br0440) 1992; 100 van den Heuvel, Pérez (br0580) 2021 Kobayashi (br0380) 2007 Dardha, Gay (br0160) 2018; vol. 10803 Pierce (br0500) 2002 Giunti, Ravara (br0270) 2013 Kobayashi, Laneve (br0330) 2017; 252 Kobayashi (br0350) 1997 Lindley, Morris (br0420) 2016 Vasconcelos (br0560) 2012; 217 Wadler (br0600) 2012 Pérez, Caires, Pfenning, Toninho (br0490) 2014; 239 Caires, Pérez (br0100) 2017; vol. 10201 Caires, Pfenning (br0090) 2010; vol. 6269 Honda, Thudichum Vasconcelos, Kubo (br0290) 1998; vol. 1381 Caires, Torres Vieira (br0120) 2009; vol. 5502 Kobayashi (br0370) 2006; vol. 4137 Atkey, Lindley, Morris (br0020) 2016; vol. 9600 Kokke, Montesi, Peressotti (br0340) 2019; 3 Parrow (br0470) 2008; 209 Gorla (br0260) 2010; 208 Carbone, Debois (br0070) 2010; vol. 38 Davide (br0520) 2002; vol. 2421 Dardha (br0130) 2014; vol. 162 Kobayashi, Sangiorgi (br0410) 2010; 32 Balzer, Toninho, Pfenning (br0050) 2019; vol. 11423 Padovani (br0450) 2013; vol. 137 Kobayashi (10.1016/j.jlamp.2021.100717_br0620) 2002; vol. 2757 Gorla (10.1016/j.jlamp.2021.100717_br0250) 2016; 26 Caires (10.1016/j.jlamp.2021.100717_br0120) 2009; vol. 5502 Takeuchi (10.1016/j.jlamp.2021.100717_br0550) 1994 Kobayashi (10.1016/j.jlamp.2021.100717_br0330) 2017; 252 Kokke (10.1016/j.jlamp.2021.100717_br0340) 2019; 3 Kobayashi (10.1016/j.jlamp.2021.100717_br0380) Kobayashi (10.1016/j.jlamp.2021.100717_br0360) 2002; 177 Igarashi (10.1016/j.jlamp.2021.100717_br0300) 2004; 311 Parrow (10.1016/j.jlamp.2021.100717_br0470) 2008; 209 Padovani (10.1016/j.jlamp.2021.100717_br0450) 2013; vol. 137 Yoshida (10.1016/j.jlamp.2021.100717_br0610) 1996; vol. 1180 Carbone (10.1016/j.jlamp.2021.100717_br0080) 2014; vol. 8459 Fowler (10.1016/j.jlamp.2021.100717_br0220) 2021; vol. 203 Honda (10.1016/j.jlamp.2021.100717_br0280) 1993; vol. 715 Boreale (10.1016/j.jlamp.2021.100717_br0040) 1998; 35 Dardha (10.1016/j.jlamp.2021.100717_br0170) 2012 Caires (10.1016/j.jlamp.2021.100717_br0110) 2016; 26 Gay (10.1016/j.jlamp.2021.100717_br0230) 2005; 42 Vasconcelos (10.1016/j.jlamp.2021.100717_br0560) 2012; 217 Toninho (10.1016/j.jlamp.2021.100717_br0540) 2014; vol. 8902 Kobayashi (10.1016/j.jlamp.2021.100717_br0400) 1999; 21 Caires (10.1016/j.jlamp.2021.100717_br0090) 2010; vol. 6269 Parrow (10.1016/j.jlamp.2021.100717_br0480) 2016; 26 Milner (10.1016/j.jlamp.2021.100717_br0430) 1991 Pérez (10.1016/j.jlamp.2021.100717_br0490) 2014; 239 Kobayashi (10.1016/j.jlamp.2021.100717_br0390) 1996 Caires (10.1016/j.jlamp.2021.100717_br0060) 2014 Dardha (10.1016/j.jlamp.2021.100717_br0180) 2017; 256 Atkey (10.1016/j.jlamp.2021.100717_br0020) 2016; vol. 9600 Kobayashi (10.1016/j.jlamp.2021.100717_br0350) 1997 Kobayashi (10.1016/j.jlamp.2021.100717_br0410) 2010; 32 Sangiorgi (10.1016/j.jlamp.2021.100717_br0530) 2001 Qian (10.1016/j.jlamp.2021.100717_br0510) 2021; 5 Kokke (10.1016/j.jlamp.2021.100717_br0310) 2021 Dardha (10.1016/j.jlamp.2021.100717_br0130) 2014; vol. 162 Carbone (10.1016/j.jlamp.2021.100717_br0070) 2010; vol. 38 van den Heuvel (10.1016/j.jlamp.2021.100717_br0580) 2021 Dardha (10.1016/j.jlamp.2021.100717_br0190) 2015; vol. 190 Abramsky (10.1016/j.jlamp.2021.100717_br0010) 1997; vol. 1281 Dezani-Ciancaglini (10.1016/j.jlamp.2021.100717_br0150) 2008; vol. 4912 Pierce (10.1016/j.jlamp.2021.100717_br0500) 2002 Dardha (10.1016/j.jlamp.2021.100717_br0140) 2016; vol. 7 Francalanza (10.1016/j.jlamp.2021.100717_br0210) 2015; vol. 188 Dardha (10.1016/j.jlamp.2021.100717_br0160) 2018; vol. 10803 Gorla (10.1016/j.jlamp.2021.100717_br0260) 2010; 208 Padovani (10.1016/j.jlamp.2021.100717_br0460) 2014 Dardha (10.1016/j.jlamp.2021.100717_br0200) Kokke (10.1016/j.jlamp.2021.100717_br0320) 2021; vol. 12719 Caires (10.1016/j.jlamp.2021.100717_br0100) 2017; vol. 10201 Milner (10.1016/j.jlamp.2021.100717_br0440) 1992; 100 Torres Vieira (10.1016/j.jlamp.2021.100717_br0590) 2013; vol. 7890 Wadler (10.1016/j.jlamp.2021.100717_br0600) 2012 Bettini (10.1016/j.jlamp.2021.100717_br0030) 2008 Kobayashi (10.1016/j.jlamp.2021.100717_br0370) 2006; vol. 4137 Giunti (10.1016/j.jlamp.2021.100717_br0270) 2013 van den Heuvel (10.1016/j.jlamp.2021.100717_br0570) 2020; vol. 314 Honda (10.1016/j.jlamp.2021.100717_br0290) 1998; vol. 1381 Lindley (10.1016/j.jlamp.2021.100717_br0420) 2016 Balzer (10.1016/j.jlamp.2021.100717_br0050) 2019; vol. 11423 Giachino (10.1016/j.jlamp.2021.100717_br0240) 2014 Davide (10.1016/j.jlamp.2021.100717_br0520) 2002; vol. 2421 |
| References_xml | – year: 2014 ident: br0460 article-title: Deadlock and lock freedom in the linear publication-title: CSL-LICS – volume: vol. 12719 start-page: 100 year: 2021 end-page: 119 ident: br0320 article-title: Prioritise the best variation publication-title: Formal Techniques for Distributed Objects, Components, and Systems - 41st IFIP WG 6.1 International Conference, FORTE 2021, Held as Part of the 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021, Proceedings – volume: 252 start-page: 48 year: 2017 end-page: 70 ident: br0330 article-title: Deadlock analysis of unbounded process networks publication-title: Inf. Comput. – volume: vol. 7890 start-page: 236 year: 2013 end-page: 250 ident: br0590 article-title: Typing progress in communication-centred systems publication-title: COORDINATION – start-page: 139 year: 2012 end-page: 150 ident: br0170 article-title: Session types revisited publication-title: PPDP'12 – volume: 42 start-page: 191 year: Nov 2005 end-page: 225 ident: br0230 article-title: Subtyping for session types in the pi calculus publication-title: Acta Inform. – volume: 217 start-page: 52 year: 2012 end-page: 70 ident: br0560 article-title: Fundamentals of session types publication-title: Inf. Comput. – volume: vol. 4912 start-page: 257 year: 2008 end-page: 275 ident: br0150 article-title: On progress for structured communications publication-title: Trustworthy Global Computing – start-page: 63 year: 2014 end-page: 77 ident: br0240 article-title: Deadlock analysis of unbounded process networks publication-title: CONCUR – volume: vol. 1381 start-page: 122 year: 1998 end-page: 138 ident: br0290 article-title: Language primitives and type discipline for structured communication-based programming publication-title: ESOP'98 – volume: 256 start-page: 253 year: 2017 end-page: 286 ident: br0180 article-title: Session types revisited publication-title: Inf. Comput. – volume: vol. 2421 start-page: 76 year: 2002 end-page: 97 ident: br0520 article-title: Types, or: where's the difference between CCS and pi? publication-title: CONCUR 2002 - Concurrency Theory, 13th International Conference, Proceedings – volume: vol. 8902 start-page: 159 year: 2014 end-page: 175 ident: br0540 article-title: Corecursion and non-divergence in session-typed processes publication-title: TGC 2014 – year: September 2014 ident: br0060 article-title: Types and logic, concurrency and non-determinism publication-title: Essays for the Luca Cardelli Fest – volume: vol. 6269 start-page: 222 year: 2010 end-page: 236 ident: br0090 article-title: Session types as intuitionistic linear propositions publication-title: CONCUR 2010 – volume: 26 start-page: 655 year: 2016 end-page: 657 ident: br0480 article-title: General conditions for full abstraction publication-title: Math. Struct. Comput. Sci. – volume: vol. 9600 start-page: 32 year: 2016 end-page: 55 ident: br0020 article-title: Conflation confers concurrency publication-title: A List of Successes That Can Change the World - Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday – volume: vol. 10201 start-page: 229 year: 2017 end-page: 259 ident: br0100 article-title: Linearity, control effects, and behavioral types publication-title: Programming Languages and Systems - 26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings – volume: 32 year: 2010 ident: br0410 article-title: A hybrid type system for lock-freedom of mobile processes publication-title: ACM Trans. Program. Lang. Syst. – volume: vol. 7 year: 2016 ident: br0140 article-title: Type Systems for Distributed Programs: Components and Sessions publication-title: Atlantis Studies in Computing – volume: 177 start-page: 122 year: 2002 end-page: 159 ident: br0360 article-title: A type system for lock-free processes publication-title: Inf. Comput. – volume: vol. 10803 start-page: 91 year: 2018 end-page: 109 ident: br0160 article-title: A new linear logic for deadlock-free session-typed processes publication-title: Foundations of Software Science and Computation Structures - 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Proceedings – volume: vol. 11423 start-page: 611 year: 2019 end-page: 639 ident: br0050 article-title: Manifest deadlock-freedom for shared session types publication-title: Programming Languages and Systems - 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Proceedings – volume: 209 start-page: 173 year: 2008 end-page: 186 ident: br0470 article-title: Expressiveness of process algebras publication-title: Electron. Notes Theor. Comput. Sci. – volume: 208 start-page: 1031 year: 2010 end-page: 1053 ident: br0260 article-title: Towards a unified approach to encodability and separation results for process calculi publication-title: Inf. Comput. – start-page: 136 year: 2013 end-page: 155 ident: br0270 article-title: Towards static deadlock resolution in the publication-title: TGC – volume: vol. 38 start-page: 13 year: 2010 end-page: 27 ident: br0070 article-title: A graphical approach to progress for structured communication in web services publication-title: ICE 2010 – volume: 311 start-page: 121 year: 2004 end-page: 163 ident: br0300 article-title: A generic type system for the pi-calculus publication-title: Theor. Comput. Sci. – volume: 35 start-page: 353 year: 1998 end-page: 400 ident: br0040 article-title: A fully abstract semantics for causality in the publication-title: Acta Inform. – start-page: 358 year: 1996 end-page: 371 ident: br0390 article-title: Linearity and the pi-calculus publication-title: POPL – year: 2021 ident: br0580 article-title: Deadlock freedom for asynchronous and cyclic process networks publication-title: Proceedings 14th Interaction and Concurrency Experience – volume: vol. 314 start-page: 1 year: 2020 end-page: 11 ident: br0570 article-title: Session type systems based on linear logic: classical versus intuitionistic publication-title: Proceedings of the 12th International Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software – volume: 5 start-page: 1 year: 2021 end-page: 31 ident: br0510 article-title: Client-server sessions in linear logic publication-title: Proc. ACM Program. Lang. – volume: vol. 8459 start-page: 49 year: 2014 end-page: 64 ident: br0080 article-title: Progress as compositional lock-freedom publication-title: Coordination Models and Languages - 16th IFIP WG 6.1 International Conference, COORDINATION 2014, Held as Part of the 9th International Federated Conferences on Distributed Computing Techniques, DisCoTec – volume: vol. 1281 start-page: 295 year: 1997 end-page: 320 ident: br0010 article-title: A type-theoretic approach to deadlock-freedom of asynchronous systems publication-title: Theoretical Aspects of Computer Software, Proceedings of the Third International Symposium – volume: vol. 715 start-page: 509 year: 1993 end-page: 523 ident: br0280 article-title: Types for dyadic interaction publication-title: The 4th International Conference on Concurrency Theory – volume: vol. 162 start-page: 27 year: 2014 end-page: 34 ident: br0130 article-title: Recursive session types revisited publication-title: Proceedings Third Workshop on Behavioural Types – start-page: 128 year: 1997 end-page: 139 ident: br0350 article-title: A partially deadlock-free typed process calculus publication-title: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science – volume: vol. 4137 start-page: 233 year: 2006 end-page: 247 ident: br0370 article-title: A new type system for deadlock-free processes publication-title: CONCUR 2006 – year: 2007 ident: br0380 article-title: Type systems for concurrent programs – start-page: 434 year: 2016 end-page: 447 ident: br0420 article-title: Talking bananas: structural recursion for session types publication-title: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming – year: 2001 ident: br0530 article-title: The – volume: vol. 1180 start-page: 371 year: 1996 end-page: 386 ident: br0610 article-title: Graph types for monadic mobile processes publication-title: FSTTCS'96 – year: 1991 ident: br0430 article-title: The Polyadic pi-Calculus: A Tutorial – volume: vol. 5502 start-page: 285 year: 2009 end-page: 300 ident: br0120 article-title: Conversation types publication-title: ESOP'09 – volume: 26 start-page: 639 year: 2016 end-page: 654 ident: br0250 article-title: Full abstraction for expressiveness: history, myths and facts publication-title: Math. Struct. Comput. Sci. – year: 2002 ident: br0500 article-title: Types and Programming Languages – start-page: 1 year: 2021 end-page: 13 ident: br0310 article-title: Deadlock-free session types in linear Haskell publication-title: Haskell 2021: Proceedings of the 14th ACM SIGPLAN International Symposium on Haskell, Virtual Event – volume: 100 start-page: 1 year: 1992 end-page: 40 ident: br0440 article-title: A calculus of mobile processes, I publication-title: Inf. Comput. – start-page: 398 year: 1994 end-page: 413 ident: br0550 article-title: An interaction-based language and its typing system publication-title: PARLE'94 – volume: 26 start-page: 367 year: 2016 end-page: 423 ident: br0110 article-title: Linear logic propositions as session types publication-title: Math. Struct. Comput. Sci. – volume: vol. 2757 start-page: 439 year: 2002 end-page: 453 ident: br0620 article-title: Type systems for concurrent programs publication-title: Formal Methods at the Crossroads: From Panacea to Foundational Support—Papers from the 10th Anniversary Colloquium of UNU/IIST the International Institute for Software Technology of the United Nations University – volume: vol. 190 start-page: 1 year: 2015 end-page: 15 ident: br0190 article-title: Comparing deadlock-free session typed processes publication-title: Combined 22nd International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, EXPRESS/SOS – start-page: 418 year: 2008 end-page: 433 ident: br0030 article-title: Global progress in dynamically interleaved multiparty sessions publication-title: CONCUR – volume: 239 start-page: 254 year: 2014 end-page: 302 ident: br0490 article-title: Linear logical relations and observational equivalences for session-based concurrency publication-title: Inf. Comput. – start-page: 273 year: 2012 end-page: 286 ident: br0600 article-title: Propositions as sessions publication-title: ICFP'12 – volume: vol. 137 start-page: 3 year: 2013 end-page: 19 ident: br0450 article-title: From lock freedom to progress using session types publication-title: Proceedings of PLACES 2013 – volume: vol. 188 start-page: 23 year: 2015 end-page: 32 ident: br0210 article-title: Unlocking blocked communicating processes publication-title: Proceedings 11th International Workshop on Automated Specification and Verification of Web Systems – volume: vol. 203 year: 2021 ident: br0220 article-title: Separating sessions smoothly publication-title: 32nd International Conference on Concurrency Theory, CONCUR 2021, Virtual Conference – year: 2020 ident: br0200 article-title: Comparing type systems for deadlock freedom – volume: 3 year: 2019 ident: br0340 article-title: Better late than never: a fully-abstract semantics for classical processes publication-title: Proc. ACM Program. Lang. – volume: 21 start-page: 914 year: 1999 end-page: 947 ident: br0400 article-title: Linearity and the pi-calculus publication-title: ACM Trans. Program. Lang. Syst. – volume: 100 start-page: 1 issue: 1 year: 1992 ident: 10.1016/j.jlamp.2021.100717_br0440 article-title: A calculus of mobile processes, I publication-title: Inf. Comput. doi: 10.1016/0890-5401(92)90008-4 – volume: vol. 10803 start-page: 91 year: 2018 ident: 10.1016/j.jlamp.2021.100717_br0160 article-title: A new linear logic for deadlock-free session-typed processes – volume: 21 start-page: 914 issue: 5 year: 1999 ident: 10.1016/j.jlamp.2021.100717_br0400 article-title: Linearity and the pi-calculus publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/330249.330251 – volume: 26 start-page: 655 issue: 4 year: 2016 ident: 10.1016/j.jlamp.2021.100717_br0480 article-title: General conditions for full abstraction publication-title: Math. Struct. Comput. Sci. doi: 10.1017/S0960129514000280 – volume: vol. 1180 start-page: 371 year: 1996 ident: 10.1016/j.jlamp.2021.100717_br0610 article-title: Graph types for monadic mobile processes – volume: 208 start-page: 1031 issue: 9 year: 2010 ident: 10.1016/j.jlamp.2021.100717_br0260 article-title: Towards a unified approach to encodability and separation results for process calculi publication-title: Inf. Comput. doi: 10.1016/j.ic.2010.05.002 – volume: vol. 1381 start-page: 122 year: 1998 ident: 10.1016/j.jlamp.2021.100717_br0290 article-title: Language primitives and type discipline for structured communication-based programming – volume: vol. 9600 start-page: 32 year: 2016 ident: 10.1016/j.jlamp.2021.100717_br0020 article-title: Conflation confers concurrency – volume: vol. 188 start-page: 23 year: 2015 ident: 10.1016/j.jlamp.2021.100717_br0210 article-title: Unlocking blocked communicating processes – start-page: 139 year: 2012 ident: 10.1016/j.jlamp.2021.100717_br0170 article-title: Session types revisited – volume: 239 start-page: 254 year: 2014 ident: 10.1016/j.jlamp.2021.100717_br0490 article-title: Linear logical relations and observational equivalences for session-based concurrency publication-title: Inf. Comput. doi: 10.1016/j.ic.2014.08.001 – year: 2021 ident: 10.1016/j.jlamp.2021.100717_br0580 article-title: Deadlock freedom for asynchronous and cyclic process networks – volume: vol. 38 start-page: 13 year: 2010 ident: 10.1016/j.jlamp.2021.100717_br0070 article-title: A graphical approach to progress for structured communication in web services – start-page: 418 year: 2008 ident: 10.1016/j.jlamp.2021.100717_br0030 article-title: Global progress in dynamically interleaved multiparty sessions – volume: vol. 1281 start-page: 295 year: 1997 ident: 10.1016/j.jlamp.2021.100717_br0010 article-title: A type-theoretic approach to deadlock-freedom of asynchronous systems – volume: vol. 7890 start-page: 236 year: 2013 ident: 10.1016/j.jlamp.2021.100717_br0590 article-title: Typing progress in communication-centred systems – ident: 10.1016/j.jlamp.2021.100717_br0380 – volume: 177 start-page: 122 issue: 2 year: 2002 ident: 10.1016/j.jlamp.2021.100717_br0360 article-title: A type system for lock-free processes publication-title: Inf. Comput. doi: 10.1016/S0890-5401(02)93171-8 – volume: 217 start-page: 52 year: 2012 ident: 10.1016/j.jlamp.2021.100717_br0560 article-title: Fundamentals of session types publication-title: Inf. Comput. doi: 10.1016/j.ic.2012.05.002 – volume: vol. 4912 start-page: 257 year: 2008 ident: 10.1016/j.jlamp.2021.100717_br0150 article-title: On progress for structured communications – volume: vol. 137 start-page: 3 year: 2013 ident: 10.1016/j.jlamp.2021.100717_br0450 article-title: From lock freedom to progress using session types – volume: vol. 8902 start-page: 159 year: 2014 ident: 10.1016/j.jlamp.2021.100717_br0540 article-title: Corecursion and non-divergence in session-typed processes – volume: vol. 715 start-page: 509 year: 1993 ident: 10.1016/j.jlamp.2021.100717_br0280 article-title: Types for dyadic interaction – volume: vol. 4137 start-page: 233 year: 2006 ident: 10.1016/j.jlamp.2021.100717_br0370 article-title: A new type system for deadlock-free processes – volume: vol. 11423 start-page: 611 year: 2019 ident: 10.1016/j.jlamp.2021.100717_br0050 article-title: Manifest deadlock-freedom for shared session types – start-page: 434 year: 2016 ident: 10.1016/j.jlamp.2021.100717_br0420 article-title: Talking bananas: structural recursion for session types – volume: vol. 2421 start-page: 76 year: 2002 ident: 10.1016/j.jlamp.2021.100717_br0520 article-title: Types, or: where's the difference between CCS and pi? – volume: 42 start-page: 191 issue: 2–3 year: 2005 ident: 10.1016/j.jlamp.2021.100717_br0230 article-title: Subtyping for session types in the pi calculus publication-title: Acta Inform. doi: 10.1007/s00236-005-0177-z – start-page: 358 year: 1996 ident: 10.1016/j.jlamp.2021.100717_br0390 article-title: Linearity and the pi-calculus – year: 2014 ident: 10.1016/j.jlamp.2021.100717_br0060 article-title: Types and logic, concurrency and non-determinism – volume: vol. 203 year: 2021 ident: 10.1016/j.jlamp.2021.100717_br0220 article-title: Separating sessions smoothly – volume: vol. 12719 start-page: 100 year: 2021 ident: 10.1016/j.jlamp.2021.100717_br0320 article-title: Prioritise the best variation – volume: 252 start-page: 48 year: 2017 ident: 10.1016/j.jlamp.2021.100717_br0330 article-title: Deadlock analysis of unbounded process networks publication-title: Inf. Comput. doi: 10.1016/j.ic.2016.03.004 – volume: vol. 8459 start-page: 49 year: 2014 ident: 10.1016/j.jlamp.2021.100717_br0080 article-title: Progress as compositional lock-freedom – volume: vol. 314 start-page: 1 year: 2020 ident: 10.1016/j.jlamp.2021.100717_br0570 article-title: Session type systems based on linear logic: classical versus intuitionistic – volume: 311 start-page: 121 issue: 1–3 year: 2004 ident: 10.1016/j.jlamp.2021.100717_br0300 article-title: A generic type system for the pi-calculus publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(03)00325-6 – volume: vol. 162 start-page: 27 year: 2014 ident: 10.1016/j.jlamp.2021.100717_br0130 article-title: Recursive session types revisited – start-page: 136 year: 2013 ident: 10.1016/j.jlamp.2021.100717_br0270 article-title: Towards static deadlock resolution in the π-calculus – volume: 3 issue: POPL year: 2019 ident: 10.1016/j.jlamp.2021.100717_br0340 article-title: Better late than never: a fully-abstract semantics for classical processes publication-title: Proc. ACM Program. Lang. doi: 10.1145/3290337 – year: 2002 ident: 10.1016/j.jlamp.2021.100717_br0500 – volume: 256 start-page: 253 year: 2017 ident: 10.1016/j.jlamp.2021.100717_br0180 article-title: Session types revisited publication-title: Inf. Comput. doi: 10.1016/j.ic.2017.06.002 – volume: vol. 190 start-page: 1 year: 2015 ident: 10.1016/j.jlamp.2021.100717_br0190 article-title: Comparing deadlock-free session typed processes – year: 1991 ident: 10.1016/j.jlamp.2021.100717_br0430 – year: 2014 ident: 10.1016/j.jlamp.2021.100717_br0460 article-title: Deadlock and lock freedom in the linear π-calculus – year: 2001 ident: 10.1016/j.jlamp.2021.100717_br0530 – volume: vol. 10201 start-page: 229 year: 2017 ident: 10.1016/j.jlamp.2021.100717_br0100 article-title: Linearity, control effects, and behavioral types – ident: 10.1016/j.jlamp.2021.100717_br0200 – start-page: 63 year: 2014 ident: 10.1016/j.jlamp.2021.100717_br0240 article-title: Deadlock analysis of unbounded process networks – volume: vol. 5502 start-page: 285 year: 2009 ident: 10.1016/j.jlamp.2021.100717_br0120 article-title: Conversation types – volume: 5 start-page: 1 issue: ICFP year: 2021 ident: 10.1016/j.jlamp.2021.100717_br0510 article-title: Client-server sessions in linear logic publication-title: Proc. ACM Program. Lang. doi: 10.1145/3473567 – volume: 209 start-page: 173 year: 2008 ident: 10.1016/j.jlamp.2021.100717_br0470 article-title: Expressiveness of process algebras publication-title: Electron. Notes Theor. Comput. Sci. doi: 10.1016/j.entcs.2008.04.011 – start-page: 1 year: 2021 ident: 10.1016/j.jlamp.2021.100717_br0310 article-title: Deadlock-free session types in linear Haskell – start-page: 273 year: 2012 ident: 10.1016/j.jlamp.2021.100717_br0600 article-title: Propositions as sessions – start-page: 128 year: 1997 ident: 10.1016/j.jlamp.2021.100717_br0350 article-title: A partially deadlock-free typed process calculus – volume: 35 start-page: 353 issue: 5 year: 1998 ident: 10.1016/j.jlamp.2021.100717_br0040 article-title: A fully abstract semantics for causality in the π-calculus publication-title: Acta Inform. doi: 10.1007/s002360050124 – volume: 26 start-page: 367 issue: 3 year: 2016 ident: 10.1016/j.jlamp.2021.100717_br0110 article-title: Linear logic propositions as session types publication-title: Math. Struct. Comput. Sci. doi: 10.1017/S0960129514000218 – volume: 26 start-page: 639 issue: 4 year: 2016 ident: 10.1016/j.jlamp.2021.100717_br0250 article-title: Full abstraction for expressiveness: history, myths and facts publication-title: Math. Struct. Comput. Sci. doi: 10.1017/S0960129514000279 – start-page: 398 year: 1994 ident: 10.1016/j.jlamp.2021.100717_br0550 article-title: An interaction-based language and its typing system – volume: 32 issue: 5 year: 2010 ident: 10.1016/j.jlamp.2021.100717_br0410 article-title: A hybrid type system for lock-freedom of mobile processes publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/1745312.1745313 – volume: vol. 2757 start-page: 439 year: 2002 ident: 10.1016/j.jlamp.2021.100717_br0620 article-title: Type systems for concurrent programs – volume: vol. 6269 start-page: 222 year: 2010 ident: 10.1016/j.jlamp.2021.100717_br0090 article-title: Session types as intuitionistic linear propositions – volume: vol. 7 year: 2016 ident: 10.1016/j.jlamp.2021.100717_br0140 article-title: Type Systems for Distributed Programs: Components and Sessions |
| SSID | ssj0001687831 |
| Score | 2.3358214 |
| Snippet | Message-passing software systems exhibit non-trivial forms of concurrency and distribution; they are expected to follow intended protocols among communicating... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 100717 |
| SubjectTerms | Concurrency Deadlock freedom Linear logic Linear types Process calculi Session types |
| Title | Comparing type systems for deadlock freedom |
| URI | https://dx.doi.org/10.1016/j.jlamp.2021.100717 |
| Volume | 124 |
| WOSCitedRecordID | wos000703502400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 2352-2208 databaseCode: AIEXJ dateStart: 20211207 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0001687831 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT8JAEN4oePDi24iv9OCtlrTblu4eCcEoMcgBDbeGbrcGxEoKGn6-s48WUELk4KVpmnba7rf5dnZ29huEbmyXcepA540Z8S2YfzGL-LZtUY_0E-pxn0md7ZfHoN0mvR7t6BL3E1lOIEhTMpvR8b9CDdcAbLF1dgO4C6NwAc4BdDgC7HD8E_ANVVlQ7IIS4VUl1SxVF8wYAIXB681MMhi01LtXeKY5HUod19GrWFoeMF1rWqWdq6Su93zYU5HuWK0dPWUpHxVk31Er8ZkKVLdEAN6sVxdjDRgvxBokJWFw1yyMbbLEn9hbYEBHLuyvJGcVJxhWh9DXhVQodqrzu5elsH8MUUXiYJ6TNgylkVAYCZWRbVTGgU-B2cr1h2avNY-01UhAZGHK4vNz-SmZ6Pfrc1a7KAtuR_cA7WlUjLrC-RBt8fQI7ee1OAxNzcfILGA3BOyGht0A2I0cdkPDfoKe75rdxr2lC2FYDFMytTBJ3NjDfZh-JnaNOpy5VASLXJdyP3bjJHFo3yMRsGskCoJyB_Mo5swD-15EE_cUldKPlJ8hAwieCk0-IvyygCfgAMKMsQb3-hzz2Kug2_zfw7HSOwnXNHoF1fL2CbXLplyxEEBf9-D5Zu-5QLvz_niJStPsk1-hHfY1HUyya434N7J_X0c |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Comparing+type+systems+for+deadlock+freedom&rft.jtitle=Journal+of+logical+and+algebraic+methods+in+programming&rft.au=Dardha%2C+Ornela&rft.au=P%C3%A9rez%2C+Jorge+A.&rft.date=2022-01-01&rft.issn=2352-2208&rft.volume=124&rft.spage=100717&rft_id=info:doi/10.1016%2Fj.jlamp.2021.100717&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jlamp_2021_100717 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2352-2208&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2352-2208&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2352-2208&client=summon |