Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
A Case for Message Oriented Middleware
Proceedings of the 13th International Symposium on Distributed Computing
Theoretical Computer Science - Implementation and application of automata
MOM vs. RPC: Communication Models for Distributed Applications
IEEE Internet Computing
Synchronizability of Conversations among Web Services
IEEE Transactions on Software Engineering
Service Interaction Modeling: Bridging Global and Local Views
EDOC '06 Proceedings of the 10th IEEE International Enterprise Distributed Object Computing Conference
Language support for fast and reliable message-based communication in singularity OS
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Singularity: rethinking the software stack
ACM SIGOPS Operating Systems Review - Systems work at Microsoft Research
Multiparty asynchronous session types
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Non-desynchronizable Service Choreographies
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Analyzing singularity channel contracts
Proceedings of the eighteenth international symposium on Software testing and analysis
Analyzing BPEL4Chor: verification and participant synthesis
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Analysis of realizability conditions for web service choreographies
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Deciding choreography realizability
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
The global interaction behavior in message-based systems can be specified as a finite-state machine defining acceptable sequences of messages exchanged by a group of peers. Realizability analysis determines if there exist local implementations for each peer, such that their composition produces exactly the intended global behavior. Although there are existing sufficient conditions for realizability, we show that these earlier results all fail for a particular class of specifications called arbitrary-initiator protocols. We present a novel algorithm for deciding realizability by computing a finite-state model that keeps track of the information about the global state of a conversation protocol that each peer can deduce from the messages it sends and receives. By searching for disagreements between each peer's deduced states, we provide a sound analysis for realizability that correctly classifies realizability of arbitrary-initiator protocols.