On the boundary between decidability and undecidability of asynchronous session subtyping

被引:21
|
作者
Bravetti, Mario [1 ]
Carbone, Marco [2 ]
Zavattaro, Gianluigi [1 ]
机构
[1] Univ Bologna, Dept Comp Sci & Engn, INRIA FOCUS, Bologna, Italy
[2] IT Univ Copenhagen, Dept Comp Sci, Copenhagen, Denmark
基金
欧盟地平线“2020”;
关键词
Session types; Asynchronous subtyping; Undecidability;
D O I
10.1016/j.tcs.2018.02.010
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Session types are behavioural types for guaranteeing that concurrent programs are free from basic communication errors. Recent work has shown that asynchronous session subtyping is undecidable. However, since session types have become popular in mainstream programming languages in which asynchronous communication is the norm rather than the exception, it is crucial to detect significant decidable subtyping relations. Previous work considered extremely restrictive fragments in which limitations were imposed to the size of communication buffer (at most 1) or to the possibility to express multiple choices (disallowing them completely in one of the compared types). In this work, for the first time, we show decidability of a fragment that does not impose any limitation on communication buffers and allows both the compared types to include multiple choices for either input or output, thus yielding a fragment which is more significant from an applicability viewpoint. In general, we study the boundary between decidability and undecidability by considering several fragments of subtyping. Notably, we show that subtyping remains undecidable even if restricted to not using output covariance and input contravariance. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:19 / 51
页数:33
相关论文
共 50 条
  • [41] Asynchronous Subtyping by Trace Relaxation
    Bocchi, Laura
    King, Andy
    Murgia, Maurizio
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT I, TACAS 2024, 2024, 14570 : 207 - 226
  • [42] ON THE PRECISENESS OF SUBTYPING IN SESSION TYPES
    Chen, Tzu-Chun
    Dezani-Ciancaglini, Mariangiola
    Scalas, Alceste
    Yoshida, Nobuko
    LOGICAL METHODS IN COMPUTER SCIENCE, 2017, 13 (02)
  • [43] On the Preciseness of Subtyping in Session Types
    Chen, Tzu-Chun
    Dezani-Ciancaglini, Mariangiola
    Yoshida, Nobuko
    PPDP'14: PROCEEDINGS OF THE 16TH INTERNATIONAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING, 2014, : 135 - 146
  • [44] Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
    Kirsten, Daniel
    THEORETICAL COMPUTER SCIENCE, 2012, 420 : 56 - 63
  • [45] Some decidability and undecidability results on Green's relations for automatic monoids
    Otto, Friedrich
    SEMIGROUP FORUM, 2007, 75 (03) : 521 - 536
  • [46] Timed automata with asynchronous processes: Schedulability and decidability
    Fersman, E
    Pettersson, P
    Yi, W
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANAYLSIS OF SYSTEMS, PROCEEDINGS, 2002, 2280 : 67 - 82
  • [47] DECIDABILITY AND UNDECIDABILITY OF EQUIVALENCE FOR LINEAR DATALOG, WITH APPLICATIONS TO NORMAL-FORM OPTIMIZATIONS
    FEDER, T
    SARAIYA, Y
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 646 : 297 - 311
  • [48] On Asynchronous Session Semantics
    Kouzapas, Dimitrios
    Yoshida, Nobuko
    Honda, Kohei
    FORMAL TECHNIQUES FOR DISTRIBUTED SYSTEMS, 2011, 6722 : 228 - 243
  • [49] Decidability and Undecidability Results on the Modal μ-Calculus with a Natural Number-Valued Semantics
    Goyet, Alexis
    Hagiya, Masami
    Tanabe, Yoshinori
    LOGIC, LANGUAGE, INFORMATION AND COMPUTATION, 2010, 6188 : 148 - +
  • [50] Precise Subtyping for Asynchronous Multiparty Sessions
    Ghilezan, Silvia
    Pantovic, Jovanka
    Prokic, Ivan
    Scalas, Alceste
    Yoshida, Nobuko
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2021, 5