Paper published in a journal (Scientific congresses, symposiums and conference proceedings)
Characterizing Implementability of Global Protocols with Infinite States and Data
Li, Elaine; STUTZ, Felix; Wies, Thomas et al.
2025In Proceedings of the ACM on Programming Languages, 9 (1), p. 1434-1463
Peer Reviewed verified by ORBi
 

Files


Full Text
oopsla25-symbolic.pdf
Publisher postprint (419.78 kB) Creative Commons License - Attribution
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Data refinements; Implementability; Message-passing; Protocol verification; Synthesis; μCLP reduction; Communications protocols; Infinite-state; State values; ΜCLP reduction; Safety, Risk, Reliability and Quality
Abstract :
[en] We study the implementability problem for an expressive class of symbolic communication protocols involving multiple participants. Our symbolic protocols describe infinite states and data values using dependent refinement predicates. Implementability asks whether a global protocol specification admits a distributed, asynchronous implementation, namely one for each participant, that is deadlock-free and exhibits the same behavior as the specification. We provide a unified explanation of seemingly disparate sources of non-implementability through a precise semantic characterization of implementability for infinite protocols. Our characterization reduces the problem of implementability to (co)reachability in the global protocol restricted to each participant. This compositional reduction yields the first sound and relatively complete algorithm for checking implementability of symbolic protocols. We use our characterization to show that for finite protocols, implementability is co-NP-complete for explicit representations and PSPACE-complete for symbolic representations. The finite, explicit fragment subsumes a previously studied fragment of multiparty session types for which our characterization yields a co-NP decision procedure, tightening a prior PSPACE upper bound.
Disciplines :
Computer science
Author, co-author :
Li, Elaine ;  New York University, United States
STUTZ, Felix  ;  University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)
Wies, Thomas ;  New York University, United States
Zufferey, Damien ;  NVIDIA, Switzerland
External co-authors :
yes
Language :
English
Title :
Characterizing Implementability of Global Protocols with Infinite States and Data
Publication date :
09 April 2025
Event name :
OOPSLA 2025
Event date :
Sun 12 - Sat 18 October 2025
Journal title :
Proceedings of the ACM on Programming Languages
eISSN :
2475-1421
Publisher :
Association for Computing Machinery
Volume :
9
Issue :
1
Pages :
1434-1463
Peer reviewed :
Peer Reviewed verified by ORBi
FnR Project :
C22/IS/17238244/AVVA
Funders :
NSF
FNR - Luxembourg National Research Fund
Available on ORBilu :
since 28 January 2026

Statistics


Number of views
6 (0 by Unilu)
Number of downloads
2 (0 by Unilu)

Scopus citations®
 
1
Scopus citations®
without self-citations
0
OpenCitations
 
0
OpenAlex citations
 
1
WoS citations
 
1

Bibliography


Similar publications



Contact ORBilu