29 citations · 54 across the 9 of their papers we have counts for
11 papers
Characterizing Implementability of Global Protocols with Infinite States and Data
Elaine Li, Felix Stutz, Thomas Wies +1
We study the implementability problem for an expressive class of symbolic communication protocols involving multiple participants. Our symbolic protocols describe infinite states a…
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…
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…
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…
Generalising Projection in Asynchronous Multiparty Session Types
Rupak Majumdar, Madhavan Mukund, Felix Stutz +1
Multiparty session types (MSTs) provide an efficient methodology for specifying and verifying message passing software systems. In the theory of MSTs, a global type specifies the i…
Multiparty Motion Coordination: From Choreographies to Robotics Programs
Rupak Majumdar, Nobuko Yoshida, Damien Zufferey
We present a programming model and typing discipline for complex multi-robot coordination programming. Our model encompasses both synchronisation through message passing and contin…
Paracosm: A Language and Tool for Testing Autonomous Driving Systems
Rupak Majumdar, Aman Mathur, Marcus Pirron +2
Systematic testing of autonomous vehicles operating in complex real-world scenarios is a difficult and expensive problem. We present Paracosm, a reactive language for writing test…
Exploiting Errors for Efficiency: A Survey from Circuits to Algorithms
Phillip Stanley-Marbell, Armin Alaghi, Michael Carbin +13
When a computational task tolerates a relaxation of its specification or when an algorithm tolerates the effects of noise in its execution, hardware, programming languages, and sys…
DroidStar: Callback Typestates for Android Classes
Arjun Radhakrishna, Nicholas V. Lewchenko, Shawn Meier +5
Event-driven programming frameworks, such as Android, are based on components with asynchronous interfaces. The protocols for interacting with these components can often be describ…
A Notion of Dynamic Interface for Depth-Bounded Object-Oriented Packages
Shahram Esmaeilsabzali, Rupak Majumdar, Thomas Wies +1
Programmers using software components have to follow protocols that specify when it is legal to call particular methods with particular arguments. For example, one cannot use an it…
Dynamic Package Interfaces - Extended Version
Shahram Esmaeilsabzali, Rupak Majumdar, Thomas Wies +1
A hallmark of object-oriented programming is the ability to perform computation through a set of interacting objects. A common manifestation of this style is the notion of a packag…