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 条
  • [1] Undecidability of asynchronous session subtyping
    Bravetti, Mario
    Carbone, Marco
    Zavattaro, Gianluigi
    INFORMATION AND COMPUTATION, 2017, 256 : 300 - 320
  • [2] On the Undecidability of Asynchronous Session Subtyping
    Lange, Julien
    Yoshida, Nobuko
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2017), 2017, 10203 : 441 - 457
  • [3] Asynchronous spiking neural P systems: Decidability and undecidability
    Cavaliere, Matteo
    Egecioglu, Omer
    Ibarra, Oscar H.
    Ionescu, Mihai
    Paun, Gheorghe
    Woodworth, Sara
    DNA COMPUTING, 2008, 4848 : 246 - +
  • [4] The boundary between decidability and undecidability tor transitive-closure logics
    Immerman, N
    Rabinovich, A
    Reps, T
    Sagiv, M
    Yorsh, G
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2004, 3210 : 160 - 174
  • [5] FAIR ASYNCHRONOUS SESSION SUBTYPING
    Bravetti, Mario
    Lange, Julien
    Zavattaro, Gianluigi
    LOGICAL METHODS IN COMPUTER SCIENCE, 2024, 20 (04) : 1 - 5
  • [6] Reset nets between decidability and undecidability
    Dufourd, C
    Finkel, A
    Schnoebelen, P
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1998, 1443 : 103 - 115
  • [7] Frontier between decidability and undecidability: a survey
    Margenstern, M
    THEORETICAL COMPUTER SCIENCE, 2000, 231 (02) : 217 - 251
  • [8] Asynchronous session subtyping as communicating automata refinement
    Mario Bravetti
    Gianluigi Zavattaro
    Software and Systems Modeling, 2021, 20 : 311 - 333
  • [9] Asynchronous session subtyping as communicating automata refinement
    Bravetti, Mario
    Zavattaro, Gianluigi
    SOFTWARE AND SYSTEMS MODELING, 2021, 20 (02): : 311 - 333
  • [10] A SOUND ALGORITHM FOR ASYNCHRONOUS SESSION SUBTYPING AND ITS IMPLEMENTATION
    Bravetti, Mario
    Carbone, Marco
    Lange, Julien
    Yoshida, Nobuko
    Zavattaro, Gianluigi
    LOGICAL METHODS IN COMPUTER SCIENCE, 2021, 17 (01) : 20:1 - 20:35