A Calculus of Communicating Systems
A Calculus of Communicating Systems
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Disciplining Orchestration and Conversation in Service-Oriented Computing
SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Multipoint session types for a distributed calculus
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
SOCK: a calculus for service oriented computing
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
SCC: a service centered calculus
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
| Hi-index | 0.00 |
Correlation sets are a programming primitive that allows instance identification in orchestration languages. A correlation set is a set of properties (i.e., values carried on by messages) that are used to associate each received message with a process instance: every time a service receives a message, it explores its content and determines a service instance that should handle the received message. Based on a concrete implementation, this paper proposes a formal model for correlation sets accounting for correlation exceptions. We also investigate different type systems aimed at ensuring that orchestrators are free from some kind of correlation exceptions.