21 citations · 25 across the 5 of their papers we have counts for
Showing 2024 · cs.PLShow all
2 papers · 2 filters
cs.PL2024★ 1 cited
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…
cs.PL2024
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…