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 条
  • [21] Decidability and Undecidability Results for Propositional Schemata
    Aravantinos, Vincent
    Caferra, Ricardo
    Peltier, Nicolas
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2011, 40 : 599 - 656
  • [22] SPECIAL ISSUE THE FRONTIER BETWEEN DECIDABILITY AND UNDECIDABILITY AND RELATED PROBLEMS PREFACE
    Durand-Lose, Jerome
    Margenstern, Maurice
    Sutner, Klaus
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (07) : 1419 - 1421
  • [23] Selected Ideas Used for Decidability and Undecidability of Bisimilarity
    Jancar, Petr
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 56 - 71
  • [24] DECIDABILITY AND UNDECIDABILITY THEOREMS FOR PAC-FIELDS
    CHERLIN, G
    VANDENDRIES, L
    MACINTYRE, A
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1981, 4 (01) : 101 - 104
  • [25] QUESTIONS OF DECIDABILITY AND UNDECIDABILITY IN NUMBER-THEORY
    MAZUR, B
    JOURNAL OF SYMBOLIC LOGIC, 1994, 59 (02) : 353 - 371
  • [26] On the Decidability of Subtyping with Bounded Existential Types
    Wehr, Stefan
    Thiemann, Peter
    PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2009, 5904 : 111 - 127
  • [28] Monadic fragments of godel logics:: Decidability and undecidability results
    Baaz, Matthias
    Ciabattoni, Agata
    Fermueller, Christian G.
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2007, 4790 : 77 - +
  • [29] Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
    Bresolin, D.
    Della Monica, D.
    Goranko, V.
    Montanari, A.
    Sciavicco, G.
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 695 - 700
  • [30] Probabilistic Automata on Infinite Words: Decidability and Undecidability Results
    Chatterjee, Krishnendu
    Henzinger, Thomas A.
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, 2010, 6252 : 1 - 16