Abstract subtyping for asynchronous multiparty sessions
From MaRDI portal
Cites work
- A fixed-points based framework for compliance of behavioural contracts
- A Practical String Analyzer by the Widening Approach
- A Sound Algorithm for Asynchronous Session Subtyping
- Combinators for parsing expressions
- Completeness of asynchronous session tree subtyping in Coq
- Derivatives of Regular Expressions
- Deriving descriptions of possible values of program variables by means of abstract interpretation
- Fair asynchronous session subtyping
- Fair testing
- Fencing off Go: liveness and safety for channel-based programming
- Full abstraction in a subtyped pi-calculus with linear types
- Fundamental properties of infinite trees
- Global Principal Typing in Partially Commutative Asynchronous Sessions
- scientific article; zbMATH DE number 7327953 (Why is no real title available?)
- Multiparty asynchronous session types
- Multiparty testing preorders
- Non-well-founded deduction for induction and coinduction
- On the boundary between decidability and undecidability of asynchronous session subtyping
- On the preciseness of subtyping in session types
- On the undecidability of asynchronous session subtyping
- Practical interruptible conversations: distributed dynamic verification with multiparty session types and Python
- Sub-behaviour relations for session-based client/server systems
- Subtyping for session types in the pi calculus
- Testing equivalences for processes
- Type analysis of prolog using type graphs
- Types and programing languages
- Undecidability of asynchronous session subtyping
This page was built for publication: Abstract subtyping for asynchronous multiparty sessions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310280)
