activity
20192026
most citedComparing Channel Restrictions of Communicating State Machines, High-level Message Sequence Charts, and Multiparty Session Types

4 citations · 12 across the 7 of their papers we have counts for

collaborators
Showing cs.FLShow all

7 papers · 1 filter

cs.FL2026

Global Protocols under Rendezvous Synchrony: From Realizability to Type Checking

Elaine Li, Felix Stutz

Global protocol specifications are the starting point of top-down verification methodologies, and serve as a blueprint for synthesizing local specifications that guarantee the corr…

cs.FL2024★ 2 cited

Deciding Subtyping for Asynchronous Multiparty Sessions

Elaine Li, Felix Stutz, Thomas Wies

Multiparty session types (MSTs) are a type-based approach to verifying communication protocols, represented as global types in the framework. We present a precise subtyping relatio…

cs.FL2023★ 2 cited

Complete Multiparty Session Type Projection with Automata

Elaine Li, Felix Stutz, Thomas Wies +1

Multiparty session types (MSTs) are a type-based approach to verifying communication protocols. Central to MSTs is a projection operator: a partial function that maps protocols rep…

cs.FL2023

Asynchronous Multiparty Session Type Implementability is Decidable -- Lessons Learned from Message Sequence Charts

Felix Stutz

Multiparty session types (MSTs) provide efficient means to specify and verify asynchronous message-passing systems. For a global type, which specifies all interactions between role…

cs.FL2022★ 4 cited

Comparing Channel Restrictions of Communicating State Machines, High-level Message Sequence Charts, and Multiparty Session Types

Felix Stutz, Damien Zufferey

Communicating state machines provide a formal foundation for distributed computation. Unfortunately, they are Turing-complete and, thus, challenging to analyse. In this paper, we c…

cs.FL2022★ 1 cited

Comparing Channel Restrictions of Communicating State Machines, High-level Message Sequence Charts, and Multiparty Session Types

Felix Stutz, Damien Zufferey

Communicating state machines provide a formal foundation for distributed computation. Unfortunately, they are Turing-complete and, thus, challenging to analyse. In this paper, we c…