21 citations · 25 across the 5 of their papers we have counts for
6 papers
Implementability of Global Distributed Protocols modulo Network Architectures
Elaine Li, Thomas Wies
Global protocols specify distributed, message-passing protocols from a birds-eye view, and are used as a specification for synthesizing local implementations. Implementability asks…
Consistent Updates for Scalable Microservices
Devora Chait-Roth, Kedar S. Namjoshi, Thomas Wies
Online services are commonly implemented with a scalable microservice architecture, where isomorphic workers process client requests, recording persistent state in a backend data s…
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…
Verifying Lock-free Search Structure Templates
Nisarg Patel, Dennis Shasha, Thomas Wies
We present and verify template algorithms for lock-free concurrent search structures that cover a broad range of existing implementations based on lists and skiplists. Our lineariz…
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…
On Verifying Complex Properties using Symbolic Shape Analysis
Thomas Wies, Viktor Kuncak, Karen Zee +2
One of the main challenges in the verification of software systems is the analysis of unbounded data structures with dynamic memory allocation, such as linked data structures and a…