Fair termination of multiparty sessions
There exists a broad family of multiparty sessions in which the progress of one session participant is not unconditional, but depends on the choices performed by other participants. These sessions fall outside the scope of currently available session type systems that guarantee progress. In this wor...
Uloženo v:
| Vydáno v: | Journal of logical and algebraic methods in programming Ročník 139; s. 100964 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
01.06.2024
|
| 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 | There exists a broad family of multiparty sessions in which the progress of one session participant is not unconditional, but depends on the choices performed by other participants. These sessions fall outside the scope of currently available session type systems that guarantee progress. In this work we propose the first type system ensuring that well-typed multiparty sessions, including those exhibiting the aforementioned dependencies, fairly terminate. Fair termination is termination under a fairness assumption that disregards those interactions deemed unfair and therefore unrealistic. Fair termination, combined with the usual safety properties ensured within sessions, not only is desirable per se, but it entails livelock freedom and enables a compositional form of static analysis such that the well-typed composition of fairly terminating sessions results in a fairly terminating program. |
|---|---|
| AbstractList | There exists a broad family of multiparty sessions in which the progress of one session participant is not unconditional, but depends on the choices performed by other participants. These sessions fall outside the scope of currently available session type systems that guarantee progress. In this work we propose the first type system ensuring that well-typed multiparty sessions, including those exhibiting the aforementioned dependencies, fairly terminate. Fair termination is termination under a fairness assumption that disregards those interactions deemed unfair and therefore unrealistic. Fair termination, combined with the usual safety properties ensured within sessions, not only is desirable per se, but it entails livelock freedom and enables a compositional form of static analysis such that the well-typed composition of fairly terminating sessions results in a fairly terminating program. |
| ArticleNumber | 100964 |
| Author | Ciccone, Luca Dagnino, Francesco Padovani, Luca |
| Author_xml | – sequence: 1 givenname: Luca surname: Ciccone fullname: Ciccone, Luca organization: University of Torino, Italy – sequence: 2 givenname: Francesco surname: Dagnino fullname: Dagnino, Francesco organization: University of Genoa, Italy – sequence: 3 givenname: Luca orcidid: 0000-0001-9097-1297 surname: Padovani fullname: Padovani, Luca email: luca.padovani@unicam.it organization: University of Camerino, Italy |
| BookMark | eNp9jztPwzAUhT0UiVL6C1iyMSX4kTjOwIAqCkiVWGC2nJtryVFesg1S_z0uYWa60tH9js53QzbTPCEhd4wWjDL50Bf9YMal4JSXKaGNLDdky0XFc86puib7EHpK06uqlWBbcn80zmcR_egmE908ZbPNxq8husX4eM4ChpDScEuurBkC7v_ujnwenz8Or_np_eXt8HTKgTcq5hLRCgVNW7cAFW2hZgIMt9h2xioAUFyUSpVYoWwlN4pzK2sjE4fGSBQ7ItZe8HMIHq1evBuNP2tG9UVR9_pXUV8U9aqYqMeVwjTt26HXARxOgJ3zCFF3s_uX_wGYKF_d |
| Cites_doi | 10.1017/S0960129514000188 10.1016/j.ic.2016.03.004 10.1145/3290343 10.1145/357172.357178 10.1016/j.jlamp.2018.12.002 10.1016/j.scico.2022.102840 10.1007/s00236-016-0285-y 10.1561/2500000031 10.1016/0304-3975(83)90059-2 10.1016/S0890-5401(02)93171-8 10.1016/j.ic.2017.06.002 10.1017/S095679681400001X 10.1145/3498666 10.1145/330249.330251 10.1017/S096012951400022X 10.1007/s00236-005-0177-z 10.1007/BF00265555 10.1145/2827695 10.1145/3290337 10.3233/FI-2019-1863 10.1017/S0960129514000218 10.1016/0950-5849(89)90159-6 10.1017/S0960129509007658 10.1007/PL00008921 10.1145/1745312.1745313 |
| ContentType | Journal Article |
| Copyright | 2024 Elsevier Inc. |
| Copyright_xml | – notice: 2024 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.jlamp.2024.100964 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_jlamp_2024_100964 S2352220824000221 |
| GroupedDBID | --M 0R~ 0SF 4.4 457 4G. 7-5 8P~ AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAXUO AAYFN ABBOA ABMAC ABVKL ABXDB ACDAQ ACGFS ACRLP ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AIALX AIEXJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BKOJK BLXMC EBS EFJIC 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 AKYEP ANKPU CITATION EFKBS EFLBG |
| ID | FETCH-LOGICAL-c298t-6eef38c9b7bcc50bc713ca2febdaf8ccc8234884e5e6b62a822f67a66eeeaa6e3 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001218767700001&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 | Sat Nov 29 01:44:44 EST 2025 Sat Jun 01 15:43:00 EDT 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Deadlock freedom Multiparty sessions Fair subtyping Fair termination |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c298t-6eef38c9b7bcc50bc713ca2febdaf8ccc8234884e5e6b62a822f67a66eeeaa6e3 |
| ORCID | 0000-0001-9097-1297 |
| OpenAccessLink | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2022.26 |
| ParticipantIDs | crossref_primary_10_1016_j_jlamp_2024_100964 elsevier_sciencedirect_doi_10_1016_j_jlamp_2024_100964 |
| PublicationCentury | 2000 |
| PublicationDate | June 2024 2024-06-00 |
| PublicationDateYYYYMMDD | 2024-06-01 |
| PublicationDate_xml | – month: 06 year: 2024 text: June 2024 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of logical and algebraic methods in programming |
| PublicationYear | 2024 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Honda, Yoshida, Carbone (br0330) 2016; 63 Ancona, Bono, Bravetti, Campos, Castagna, Deniélou, Gay, Gesbert, Giachino, Hu, Johnsen, Martins, Mascardi, Montesi, Neykova, Ng, Padovani, Vasconcelos, Yoshida (br0560) 2016; 3 Ghilezan, Jaksic, Pantovic, Scalas, Yoshida (br0340) 2019; 104 Courcelle (br0250) 1983; 25 Dagnino (br0280) 2019; 15 Caires, Pfenning, Toninho (br0220) 2016; 26 Honda (br0010) 1993; vol. 715 Francez Fairness (br0180) 1986 Padovani (br0090) 2016; 26 Carbone, Montesi, Schürmann, Yoshida (br0070) 2017; 54 Carbone, Lindley, Montesi, Schürmann, Wadler (br0260) 2016; vol. 59 Jacobs, Balzer, Krebbers (br0530) 2022; 6 Pérez, Caires, Pfenning, Toninho (br0390) 2012; vol. 7211 Bocchi, Melgratti, Tuosto (br0370) 2020; 16 Honda, Yoshida, Carbone (br0320) 2008 Coppo, Dezani-Ciancaglini, Yoshida, Padovani (br0130) 2016; 26 Wadler (br0230) 2014; 24 Kwiatkowska (br0360) 1989; 31 Scalas, Yoshida (br0060) 2019; 3 Bravetti, Zavattaro (br0080) 2009; 19 Ciccone, Dagnino, Padovani (br0170) 2022; vol. 222 Dardha, Giachino, Sangiorgi (br0430) 2017; 256 Kobayashi, Sangiorgi (br0440) 2010; 32 Dagnino (br0300) 2021 Abramsky, Gay, Nagarajan (br0480) 1996 de'Liguoro, Padovani (br0520) 2018; vol. 109 Kobayashi (br0490) 2006; vol. 4137 van den Heuvel, Pérez (br0380) 2022; 222 Carbone, Debois (br0500) 2010; vol. 38 Ciccone, Padovani FairCheck (br0540) 2021 van Glabbeek, Höfner (br0050) 2019; 52 Padovani (br0410) 2014 Ciccone, Padovani (br0450) 2022; vol. 243 Kobayashi, Laneve (br0510) 2017; 252 Kokke, Montesi, Peressotti (br0460) 2018; vol. 292 Ciccone, Padovani (br0140) 2022; 6 Ancona, Dagnino, Zucca (br0270) 2017; vol. 10201 Kobayashi (br0400) 2002; 177 Gay, Hole (br0100) 2005; 42 Honda, Vasconcelos, Kubo (br0020) 1998; vol. 1381 Kokke, Montesi, Peressotti (br0470) 2019; 3 Owicki, Lamport (br0040) 1982; 4 Kobayashi, Pierce, Turner (br0420) 1999; 21 Yoshida, Hu, Neykova, Ng (br0550) 2013; vol. 8358 Severi, Dezani-Ciancaglini (br0350) 2019; 170 Lindley, Morris (br0240) 2016 Padovani, Vasconcelos, Vieira (br0120) 2014; vol. 8459 Gay (br0310) 2016; vol. 9600 Padovani (br0150) 2013; vol. 7966 Ciccone, Padovani (br0160) 2021; vol. 198 Queille, Sifakis (br0210) 1983; 19 Hüttel, Lanese, Vasconcelos, Caires, Carbone, Deniélou, Mostrous, Padovani, Ravara, Tuosto, Vieira, Zavattaro (br0030) 2016; 49 Lamport (br0200) 2000; 13 Ciccone, Dagnino, Zucca (br0290) 2021; vol. 193 Apt, Francez, Katz (br0190) 1987 van Glabbeek, Höfner, Horne (br0110) 2021 Apt (10.1016/j.jlamp.2024.100964_br0190) 1987 Honda (10.1016/j.jlamp.2024.100964_br0330) 2016; 63 Ancona (10.1016/j.jlamp.2024.100964_br0270) 2017; vol. 10201 Courcelle (10.1016/j.jlamp.2024.100964_br0250) 1983; 25 Caires (10.1016/j.jlamp.2024.100964_br0220) 2016; 26 Kobayashi (10.1016/j.jlamp.2024.100964_br0510) 2017; 252 Ciccone (10.1016/j.jlamp.2024.100964_br0450) 2022; vol. 243 Carbone (10.1016/j.jlamp.2024.100964_br0260) 2016; vol. 59 Scalas (10.1016/j.jlamp.2024.100964_br0060) 2019; 3 Ancona (10.1016/j.jlamp.2024.100964_br0560) 2016; 3 Honda (10.1016/j.jlamp.2024.100964_br0020) 1998; vol. 1381 Padovani (10.1016/j.jlamp.2024.100964_br0410) 2014 Queille (10.1016/j.jlamp.2024.100964_br0210) 1983; 19 Ciccone (10.1016/j.jlamp.2024.100964_br0170) 2022; vol. 222 Kwiatkowska (10.1016/j.jlamp.2024.100964_br0360) 1989; 31 Jacobs (10.1016/j.jlamp.2024.100964_br0530) 2022; 6 Lindley (10.1016/j.jlamp.2024.100964_br0240) 2016 Dagnino (10.1016/j.jlamp.2024.100964_br0280) 2019; 15 Severi (10.1016/j.jlamp.2024.100964_br0350) 2019; 170 Ghilezan (10.1016/j.jlamp.2024.100964_br0340) 2019; 104 Honda (10.1016/j.jlamp.2024.100964_br0320) 2008 Ciccone (10.1016/j.jlamp.2024.100964_br0540) Padovani (10.1016/j.jlamp.2024.100964_br0120) 2014; vol. 8459 Padovani (10.1016/j.jlamp.2024.100964_br0090) 2016; 26 Carbone (10.1016/j.jlamp.2024.100964_br0500) 2010; vol. 38 Kokke (10.1016/j.jlamp.2024.100964_br0460) 2018; vol. 292 Kokke (10.1016/j.jlamp.2024.100964_br0470) 2019; 3 Francez Fairness (10.1016/j.jlamp.2024.100964_br0180) 1986 Bravetti (10.1016/j.jlamp.2024.100964_br0080) 2009; 19 Padovani (10.1016/j.jlamp.2024.100964_br0150) 2013; vol. 7966 Hüttel (10.1016/j.jlamp.2024.100964_br0030) 2016; 49 Lamport (10.1016/j.jlamp.2024.100964_br0200) 2000; 13 Yoshida (10.1016/j.jlamp.2024.100964_br0550) 2013; vol. 8358 de'Liguoro (10.1016/j.jlamp.2024.100964_br0520) 2018; vol. 109 Coppo (10.1016/j.jlamp.2024.100964_br0130) 2016; 26 Ciccone (10.1016/j.jlamp.2024.100964_br0160) 2021; vol. 198 Owicki (10.1016/j.jlamp.2024.100964_br0040) 1982; 4 Ciccone (10.1016/j.jlamp.2024.100964_br0140) 2022; 6 Carbone (10.1016/j.jlamp.2024.100964_br0070) 2017; 54 Ciccone (10.1016/j.jlamp.2024.100964_br0290) 2021; vol. 193 Wadler (10.1016/j.jlamp.2024.100964_br0230) 2014; 24 Kobayashi (10.1016/j.jlamp.2024.100964_br0440) 2010; 32 Dagnino (10.1016/j.jlamp.2024.100964_br0300) 2021 Kobayashi (10.1016/j.jlamp.2024.100964_br0400) 2002; 177 Bocchi (10.1016/j.jlamp.2024.100964_br0370) 2020; 16 Kobayashi (10.1016/j.jlamp.2024.100964_br0420) 1999; 21 Honda (10.1016/j.jlamp.2024.100964_br0010) 1993; vol. 715 Gay (10.1016/j.jlamp.2024.100964_br0100) 2005; 42 van Glabbeek (10.1016/j.jlamp.2024.100964_br0050) 2019; 52 Gay (10.1016/j.jlamp.2024.100964_br0310) 2016; vol. 9600 Dardha (10.1016/j.jlamp.2024.100964_br0430) 2017; 256 Abramsky (10.1016/j.jlamp.2024.100964_br0480) 1996 Kobayashi (10.1016/j.jlamp.2024.100964_br0490) 2006; vol. 4137 van den Heuvel (10.1016/j.jlamp.2024.100964_br0380) 2022; 222 Pérez (10.1016/j.jlamp.2024.100964_br0390) 2012; vol. 7211 van Glabbeek (10.1016/j.jlamp.2024.100964_br0110) 2021 |
| References_xml | – volume: 13 start-page: 239 year: 2000 end-page: 245 ident: br0200 article-title: Fairness and hyperfairness publication-title: Distrib. Comput. – volume: vol. 7211 start-page: 539 year: 2012 end-page: 558 ident: br0390 article-title: Linear logical relations for session-based concurrency publication-title: Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings – volume: vol. 109 start-page: 15:1 year: 2018 end-page: 15:28 ident: br0520 article-title: Mailbox types for unordered interactions publication-title: 32nd European Conference on Object-Oriented Programming – volume: vol. 8459 start-page: 147 year: 2014 end-page: 162 ident: br0120 article-title: Typing liveness in multiparty communicating systems 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 2014, Berlin, Germany, June 3-5, 2014, Proceedings – volume: 49 start-page: 3:1 year: 2016 end-page: 3:36 ident: br0030 article-title: Foundations of session types and behavioural contracts publication-title: ACM Comput. Surv. – volume: vol. 715 start-page: 509 year: 1993 end-page: 523 ident: br0010 article-title: Types for dyadic interaction publication-title: CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings – volume: vol. 1381 start-page: 122 year: 1998 end-page: 138 ident: br0020 article-title: Language primitives and type discipline for structured communication-based programming publication-title: Programming Languages and Systems - ESOP'98, 7th European Symposium on Programming, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings – volume: vol. 10201 start-page: 29 year: 2017 end-page: 55 ident: br0270 article-title: Generalizing inference systems by coaxioms 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, Uppsala, Sweden, April 22-29, 2017, Proceedings – volume: 104 start-page: 127 year: 2019 end-page: 173 ident: br0340 article-title: Precise subtyping for synchronous multiparty sessions publication-title: J. Log. Algebraic Methods Program. – volume: 19 start-page: 601 year: 2009 end-page: 638 ident: br0080 article-title: A theory of contracts for strong service compliance publication-title: Math. Struct. Comput. Sci. – volume: vol. 193 year: 2021 ident: br0290 article-title: Flexible coinduction in Agda publication-title: 12th International Conference on Interactive Theorem Proving – volume: 54 start-page: 243 year: 2017 end-page: 269 ident: br0070 article-title: Multiparty session types as coherence proofs publication-title: Acta Inform. – volume: 170 start-page: 267 year: 2019 end-page: 305 ident: br0350 article-title: Observational equivalence for multiparty sessions publication-title: Fundam. Inform. – volume: 31 start-page: 371 year: 1989 end-page: 386 ident: br0360 article-title: Survey of fairness notions publication-title: Inf. Softw. Technol. – start-page: 189 year: 1987 end-page: 198 ident: br0190 article-title: Appraising fairness in languages for distributed programming publication-title: Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages – volume: vol. 38 start-page: 13 year: 2010 end-page: 27 ident: br0500 article-title: A graphical approach to progress for structured communication in web services publication-title: Proceedings Third Interaction and Concurrency Experience: Guaranteed Interaction – volume: 6 start-page: 1 year: 2022 end-page: 33 ident: br0530 article-title: Connectivity graphs: a method for proving deadlock freedom based on separation logic publication-title: Proc. ACM Program. Lang. – volume: 52 year: 2019 ident: br0050 article-title: Progress, justness, and fairness publication-title: ACM Comput. Surv. – volume: 16 year: 2020 ident: br0370 article-title: On resolving non-determinism in choreographies publication-title: Log. Methods Comput. Sci. – volume: vol. 4137 start-page: 233 year: 2006 end-page: 247 ident: br0490 article-title: A new type system for deadlock-free processes publication-title: CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings – volume: 3 year: 2019 ident: br0060 article-title: Less is more: multiparty session types revisited publication-title: Proc. ACM Program. Lang. – volume: vol. 292 start-page: 90 year: 2018 end-page: 103 ident: br0460 article-title: Taking linear logic apart publication-title: Proceedings Joint International Workshop on Linearity & Trends in Linear Logic and Applications – start-page: 35 year: 1996 end-page: 113 ident: br0480 article-title: Interaction categories and the foundations of typed concurrent programming publication-title: Proceedings of the NATO Advanced Study Institute on Deductive Program Design – start-page: 1 year: 2021 end-page: 13 ident: br0110 article-title: Assuming Just Enough Fairness to Make Session Types Complete for Lock-Freedom publication-title: 36th Annual ACM/IEEE Symposium on Logic in Computer Science – year: 2021 ident: br0300 article-title: Flexible Coinduction – volume: vol. 8358 start-page: 22 year: 2013 end-page: 41 ident: br0550 article-title: The scribble protocol language publication-title: Trustworthy Global Computing - 8th International Symposium, TGC 2013, Buenos Aires, Argentina, August 30-31, 2013, Revised Selected Papers – volume: 42 start-page: 191 year: 2005 end-page: 225 ident: br0100 article-title: Subtyping for session types in the pi calculus publication-title: Acta Inform. – volume: vol. 222 year: 2022 ident: br0170 article-title: Fair termination of multiparty sessions publication-title: 36th European Conference on Object-Oriented Programming – volume: vol. 7966 start-page: 373 year: 2013 end-page: 384 ident: br0150 article-title: Fair subtyping for open session types publication-title: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II – volume: vol. 198 year: 2021 ident: br0160 article-title: Inference systems with corules for fair subtyping and liveness properties of binary session types publication-title: Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP'21) – volume: 26 start-page: 367 year: 2016 end-page: 423 ident: br0220 article-title: Linear logic propositions as session types publication-title: Math. Struct. Comput. Sci. – volume: 6 start-page: 1 year: 2022 end-page: 30 ident: br0140 article-title: Fair termination of binary sessions publication-title: Proc. ACM Program. Lang. – volume: 32 year: 2010 ident: br0440 article-title: A hybrid type system for lock-freedom of mobile processes publication-title: ACM Trans. Program. Lang. Syst. – volume: 252 start-page: 48 year: 2017 end-page: 70 ident: br0510 article-title: Deadlock analysis of unbounded process networks publication-title: Inf. Comput. – volume: 15 year: 2019 ident: br0280 article-title: Coaxioms: flexible coinductive definitions by inference systems publication-title: Log. Methods Comput. Sci. – volume: 177 start-page: 122 year: 2002 end-page: 159 ident: br0400 article-title: A type system for lock-free processes publication-title: Inf. Comput. – volume: vol. 9600 start-page: 95 year: 2016 end-page: 108 ident: br0310 article-title: Subtyping supports safe session substitution publication-title: A List of Successes That Can Change the World - Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday – volume: 3 start-page: 24:1 year: 2019 end-page: 24:29 ident: br0470 article-title: Better late than never: a fully-abstract semantics for classical processes publication-title: Proc. ACM Program. Lang. – start-page: 273 year: 2008 end-page: 284 ident: br0320 article-title: Multiparty asynchronous session types publication-title: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages – volume: 21 start-page: 914 year: 1999 end-page: 947 ident: br0420 article-title: Linearity and the pi-calculus publication-title: ACM Trans. Program. Lang. Syst. – volume: vol. 59 year: 2016 ident: br0260 article-title: Coherence generalises duality: a logical explanation of multiparty session types publication-title: 27th International Conference on Concurrency Theory – year: 2021 ident: br0540 article-title: GitHub repository – volume: 4 start-page: 455 year: 1982 end-page: 495 ident: br0040 article-title: Proving liveness properties of concurrent programs publication-title: ACM Trans. Program. Lang. Syst. – volume: vol. 243 year: 2022 ident: br0450 article-title: An infinitary proof theory of linear logic ensuring fair termination in the linear publication-title: 33rd International Conference on Concurrency Theory – year: 1986 ident: br0180 publication-title: Texts and Monographs in Computer Science – year: 2014 ident: br0410 article-title: Deadlock and lock freedom in the linear publication-title: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) – start-page: 434 year: 2016 end-page: 447 ident: br0240 article-title: Talking bananas: structural recursion for session types publication-title: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming – volume: 26 start-page: 424 year: 2016 end-page: 464 ident: br0090 article-title: Fair subtyping for multi-party session types publication-title: Math. Struct. Comput. Sci. – volume: 63 year: 2016 ident: br0330 article-title: Multiparty asynchronous session types publication-title: J. ACM – volume: 26 start-page: 238 year: 2016 end-page: 302 ident: br0130 article-title: Global progress for dynamically interleaved multiparty sessions publication-title: Math. Struct. Comput. Sci. – volume: 19 start-page: 195 year: 1983 end-page: 220 ident: br0210 article-title: Fairness and related properties in transition systems - a temporal logic to deal with fairness publication-title: Acta Inform. – volume: 25 start-page: 95 year: 1983 end-page: 169 ident: br0250 article-title: Fundamental properties of infinite trees publication-title: Theor. Comput. Sci. – volume: 3 start-page: 95 year: 2016 end-page: 230 ident: br0560 article-title: Behavioral types in programming languages publication-title: Found. Trends Program. Lang. – volume: 222 year: 2022 ident: br0380 article-title: A decentralized analysis of multiparty protocols publication-title: Sci. Comput. Program. – volume: 24 start-page: 384 year: 2014 end-page: 418 ident: br0230 article-title: Propositions as sessions publication-title: J. Funct. Program. – volume: 256 start-page: 253 year: 2017 end-page: 286 ident: br0430 article-title: Session types revisited publication-title: Inf. Comput. – volume: 26 start-page: 238 year: 2016 ident: 10.1016/j.jlamp.2024.100964_br0130 article-title: Global progress for dynamically interleaved multiparty sessions publication-title: Math. Struct. Comput. Sci. doi: 10.1017/S0960129514000188 – volume: 252 start-page: 48 year: 2017 ident: 10.1016/j.jlamp.2024.100964_br0510 article-title: Deadlock analysis of unbounded process networks publication-title: Inf. Comput. doi: 10.1016/j.ic.2016.03.004 – volume: 3 year: 2019 ident: 10.1016/j.jlamp.2024.100964_br0060 article-title: Less is more: multiparty session types revisited publication-title: Proc. ACM Program. Lang. doi: 10.1145/3290343 – volume: vol. 8358 start-page: 22 year: 2013 ident: 10.1016/j.jlamp.2024.100964_br0550 article-title: The scribble protocol language – volume: 49 start-page: 3:1 year: 2016 ident: 10.1016/j.jlamp.2024.100964_br0030 article-title: Foundations of session types and behavioural contracts publication-title: ACM Comput. Surv. – volume: vol. 10201 start-page: 29 year: 2017 ident: 10.1016/j.jlamp.2024.100964_br0270 article-title: Generalizing inference systems by coaxioms – volume: vol. 8459 start-page: 147 year: 2014 ident: 10.1016/j.jlamp.2024.100964_br0120 article-title: Typing liveness in multiparty communicating systems – volume: 4 start-page: 455 year: 1982 ident: 10.1016/j.jlamp.2024.100964_br0040 article-title: Proving liveness properties of concurrent programs publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/357172.357178 – volume: 15 year: 2019 ident: 10.1016/j.jlamp.2024.100964_br0280 article-title: Coaxioms: flexible coinductive definitions by inference systems publication-title: Log. Methods Comput. Sci. – volume: 104 start-page: 127 year: 2019 ident: 10.1016/j.jlamp.2024.100964_br0340 article-title: Precise subtyping for synchronous multiparty sessions publication-title: J. Log. Algebraic Methods Program. doi: 10.1016/j.jlamp.2018.12.002 – volume: 222 year: 2022 ident: 10.1016/j.jlamp.2024.100964_br0380 article-title: A decentralized analysis of multiparty protocols publication-title: Sci. Comput. Program. doi: 10.1016/j.scico.2022.102840 – volume: 54 start-page: 243 year: 2017 ident: 10.1016/j.jlamp.2024.100964_br0070 article-title: Multiparty session types as coherence proofs publication-title: Acta Inform. doi: 10.1007/s00236-016-0285-y – volume: vol. 7966 start-page: 373 year: 2013 ident: 10.1016/j.jlamp.2024.100964_br0150 article-title: Fair subtyping for open session types – year: 1986 ident: 10.1016/j.jlamp.2024.100964_br0180 – start-page: 434 year: 2016 ident: 10.1016/j.jlamp.2024.100964_br0240 article-title: Talking bananas: structural recursion for session types – ident: 10.1016/j.jlamp.2024.100964_br0540 – volume: vol. 198 year: 2021 ident: 10.1016/j.jlamp.2024.100964_br0160 article-title: Inference systems with corules for fair subtyping and liveness properties of binary session types – volume: 3 start-page: 95 year: 2016 ident: 10.1016/j.jlamp.2024.100964_br0560 article-title: Behavioral types in programming languages publication-title: Found. Trends Program. Lang. doi: 10.1561/2500000031 – volume: 25 start-page: 95 year: 1983 ident: 10.1016/j.jlamp.2024.100964_br0250 article-title: Fundamental properties of infinite trees publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(83)90059-2 – volume: 177 start-page: 122 year: 2002 ident: 10.1016/j.jlamp.2024.100964_br0400 article-title: A type system for lock-free processes publication-title: Inf. Comput. doi: 10.1016/S0890-5401(02)93171-8 – volume: 256 start-page: 253 year: 2017 ident: 10.1016/j.jlamp.2024.100964_br0430 article-title: Session types revisited publication-title: Inf. Comput. doi: 10.1016/j.ic.2017.06.002 – volume: vol. 1381 start-page: 122 year: 1998 ident: 10.1016/j.jlamp.2024.100964_br0020 article-title: Language primitives and type discipline for structured communication-based programming – volume: 6 start-page: 1 year: 2022 ident: 10.1016/j.jlamp.2024.100964_br0530 article-title: Connectivity graphs: a method for proving deadlock freedom based on separation logic publication-title: Proc. ACM Program. Lang. – volume: 52 year: 2019 ident: 10.1016/j.jlamp.2024.100964_br0050 article-title: Progress, justness, and fairness publication-title: ACM Comput. Surv. – volume: vol. 222 year: 2022 ident: 10.1016/j.jlamp.2024.100964_br0170 article-title: Fair termination of multiparty sessions – year: 2021 ident: 10.1016/j.jlamp.2024.100964_br0300 – volume: 24 start-page: 384 year: 2014 ident: 10.1016/j.jlamp.2024.100964_br0230 article-title: Propositions as sessions publication-title: J. Funct. Program. doi: 10.1017/S095679681400001X – volume: vol. 193 year: 2021 ident: 10.1016/j.jlamp.2024.100964_br0290 article-title: Flexible coinduction in Agda – volume: vol. 38 start-page: 13 year: 2010 ident: 10.1016/j.jlamp.2024.100964_br0500 article-title: A graphical approach to progress for structured communication in web services – volume: 6 start-page: 1 year: 2022 ident: 10.1016/j.jlamp.2024.100964_br0140 article-title: Fair termination of binary sessions publication-title: Proc. ACM Program. Lang. doi: 10.1145/3498666 – volume: vol. 292 start-page: 90 year: 2018 ident: 10.1016/j.jlamp.2024.100964_br0460 article-title: Taking linear logic apart – volume: 16 year: 2020 ident: 10.1016/j.jlamp.2024.100964_br0370 article-title: On resolving non-determinism in choreographies publication-title: Log. Methods Comput. Sci. – start-page: 189 year: 1987 ident: 10.1016/j.jlamp.2024.100964_br0190 article-title: Appraising fairness in languages for distributed programming – volume: vol. 9600 start-page: 95 year: 2016 ident: 10.1016/j.jlamp.2024.100964_br0310 article-title: Subtyping supports safe session substitution – volume: 21 start-page: 914 year: 1999 ident: 10.1016/j.jlamp.2024.100964_br0420 article-title: Linearity and the pi-calculus publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/330249.330251 – volume: vol. 59 year: 2016 ident: 10.1016/j.jlamp.2024.100964_br0260 article-title: Coherence generalises duality: a logical explanation of multiparty session types – volume: 26 start-page: 424 year: 2016 ident: 10.1016/j.jlamp.2024.100964_br0090 article-title: Fair subtyping for multi-party session types publication-title: Math. Struct. Comput. Sci. doi: 10.1017/S096012951400022X – volume: 42 start-page: 191 year: 2005 ident: 10.1016/j.jlamp.2024.100964_br0100 article-title: Subtyping for session types in the pi calculus publication-title: Acta Inform. doi: 10.1007/s00236-005-0177-z – start-page: 273 year: 2008 ident: 10.1016/j.jlamp.2024.100964_br0320 article-title: Multiparty asynchronous session types – volume: 19 start-page: 195 year: 1983 ident: 10.1016/j.jlamp.2024.100964_br0210 article-title: Fairness and related properties in transition systems - a temporal logic to deal with fairness publication-title: Acta Inform. doi: 10.1007/BF00265555 – volume: 63 year: 2016 ident: 10.1016/j.jlamp.2024.100964_br0330 article-title: Multiparty asynchronous session types publication-title: J. ACM doi: 10.1145/2827695 – volume: 3 start-page: 24:1 year: 2019 ident: 10.1016/j.jlamp.2024.100964_br0470 article-title: Better late than never: a fully-abstract semantics for classical processes publication-title: Proc. ACM Program. Lang. doi: 10.1145/3290337 – volume: 170 start-page: 267 year: 2019 ident: 10.1016/j.jlamp.2024.100964_br0350 article-title: Observational equivalence for multiparty sessions publication-title: Fundam. Inform. doi: 10.3233/FI-2019-1863 – volume: vol. 4137 start-page: 233 year: 2006 ident: 10.1016/j.jlamp.2024.100964_br0490 article-title: A new type system for deadlock-free processes – start-page: 35 year: 1996 ident: 10.1016/j.jlamp.2024.100964_br0480 article-title: Interaction categories and the foundations of typed concurrent programming – year: 2014 ident: 10.1016/j.jlamp.2024.100964_br0410 article-title: Deadlock and lock freedom in the linear π-calculus – volume: vol. 109 start-page: 15:1 year: 2018 ident: 10.1016/j.jlamp.2024.100964_br0520 article-title: Mailbox types for unordered interactions – volume: vol. 715 start-page: 509 year: 1993 ident: 10.1016/j.jlamp.2024.100964_br0010 article-title: Types for dyadic interaction – start-page: 1 year: 2021 ident: 10.1016/j.jlamp.2024.100964_br0110 article-title: Assuming Just Enough Fairness to Make Session Types Complete for Lock-Freedom – volume: 26 start-page: 367 year: 2016 ident: 10.1016/j.jlamp.2024.100964_br0220 article-title: Linear logic propositions as session types publication-title: Math. Struct. Comput. Sci. doi: 10.1017/S0960129514000218 – volume: 31 start-page: 371 year: 1989 ident: 10.1016/j.jlamp.2024.100964_br0360 article-title: Survey of fairness notions publication-title: Inf. Softw. Technol. doi: 10.1016/0950-5849(89)90159-6 – volume: vol. 7211 start-page: 539 year: 2012 ident: 10.1016/j.jlamp.2024.100964_br0390 article-title: Linear logical relations for session-based concurrency – volume: vol. 243 year: 2022 ident: 10.1016/j.jlamp.2024.100964_br0450 article-title: An infinitary proof theory of linear logic ensuring fair termination in the linear π-calculus – volume: 19 start-page: 601 year: 2009 ident: 10.1016/j.jlamp.2024.100964_br0080 article-title: A theory of contracts for strong service compliance publication-title: Math. Struct. Comput. Sci. doi: 10.1017/S0960129509007658 – volume: 13 start-page: 239 year: 2000 ident: 10.1016/j.jlamp.2024.100964_br0200 article-title: Fairness and hyperfairness publication-title: Distrib. Comput. doi: 10.1007/PL00008921 – volume: 32 year: 2010 ident: 10.1016/j.jlamp.2024.100964_br0440 article-title: A hybrid type system for lock-freedom of mobile processes publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/1745312.1745313 |
| SSID | ssj0001687831 |
| Score | 2.3236785 |
| Snippet | There exists a broad family of multiparty sessions in which the progress of one session participant is not unconditional, but depends on the choices performed... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 100964 |
| SubjectTerms | Deadlock freedom Fair subtyping Fair termination Multiparty sessions |
| Title | Fair termination of multiparty sessions |
| URI | https://dx.doi.org/10.1016/j.jlamp.2024.100964 |
| Volume | 139 |
| WOSCitedRecordID | wos001218767700001&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: ScienceDirect database issn: 2352-2208 databaseCode: AIEXJ dateStart: 20211206 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/eLvHCXMwtV1bS8MwGA2iPvjiXZw3-iD4oJWZtrk8ihdURAQV9lbSb6l0aCfrFP33fmkS6x0VfCmjLNmW0309SU7PIWRdcYnzZMFCqoCFMVNJmCWUhztCdvGagnaiaqRP-dmZ6HTkuUtxrOo4AV6W4vFR3v0r1HgOwTaPzv4C7pdO8QS-RtDxiLDj8UfAH6pisOk0Lp4OWtkgvvlps7JGHNUXrNSXwtrD9ebabCsX4HKmreTcCrpu_S3P7F8UgLNqm9h830h_9tV1WdTJ3ja-Q1fQb3asuv0HGyfVtHGLDzRuRFJ2Rcw_FfNGtEmR1IWUtsWbKms9iz5UbLt40Nvu4R_A-IfS2Ag3pLU2f2eFfWF6Nh0b4SuSD5z1jlGeSKxmY7vHB52TZnWNCS7qMMqXL-Mtp2px34dP-5yWvKIal9Nk0qER7FpsZ8iILmfJlM_fCFw5niMbBurgFdRBPw8aqAMP9Ty5Ojy43DsKXfBFCFSKYci0ziMBMuMZQNLOgO9EoGius67KBQAIGmHhjXWiWcaoQpKXM64YttNKMR0tkNEScV8kQSRikMBUnGgVR9y4C-aA97S27CqeyaRFtvzvTu-sv0nqhX-9tB6m1AxTaoepRZgfm9RRNEu9UsTzu4ZLf224TCaaC2-FjA4H93qVjMPDsKgGaw73Z7c3Yq4 |
| 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=Fair+termination+of+multiparty+sessions&rft.jtitle=Journal+of+logical+and+algebraic+methods+in+programming&rft.au=Ciccone%2C+Luca&rft.au=Dagnino%2C+Francesco&rft.au=Padovani%2C+Luca&rft.date=2024-06-01&rft.pub=Elsevier+Inc&rft.issn=2352-2208&rft.volume=139&rft_id=info:doi/10.1016%2Fj.jlamp.2024.100964&rft.externalDocID=S2352220824000221 |
| 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 |