Fair subtyping for multi-party session types

Authors:
Luca Padovani
Affiliations:
Dipartimento di Informatica, Università di Torino, Italy
Venue:
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Year:
2011

Citing 18
Cited 4

Acceptance trees

Journal of the ACM (JACM)
CCS without &tgr;'s

The International Joint Conference on theory and practice of software development on TAPSOFT '87
Algebraic theory of processes

Algebraic theory of processes
Language Primitives and Type Discipline for Structured Communication-Based Programming

ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Divergence and Fair Testing

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Types for Dynamic Interaction

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Subtyping for session types in the pi calculus

Acta Informatica
Fair testing

Information and Computation
Multiparty asynchronous session types

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types

Journal of the ACM (JACM)
A Foundational Theory of Contracts for Multi-party Service Composition

Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
A theory of contracts for Web services

ACM Transactions on Programming Languages and Systems (TOPLAS)
A theory of contracts for strong service compliance

Mathematical Structures in Computer Science
Fundamentals of Session Types

Formal Methods for Web Services
Foundations of session types

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Structured communication-centred programming for web services

ESOP'07 Proceedings of the 16th European conference on Programming
Two notions of sub-behaviour for session-based client/server systems

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Compliance preorders for web services

WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods

Full abstraction in a subtyped pi-calculus with linear types

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Reliable contracts for unreliable half-duplex communications

WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
Fair subtyping for open session types

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Mutually testing processes

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The standard subtyping relation used in dyadic session type theories may compromise the liveness of multi-party sessions. In this paper we define a fair subtyping relation for multi-party session types that preserves liveness, we relate it with the standard subtyping relation, and we give algorithms for deciding it. As a side effect, we provide an original and remarkably simple coinductive characterization of the fair testing preorder for nondeterministic, sequential processes consisting of internal choices of outputs and external choices of inputs.