zbMATH — the first resource for mathematics

Regulating data exchange in service oriented applications. (English) Zbl 1141.68509
Arbab, Farhad (ed.) et al., International symposium on fundamentals of software engineering. International symposium, FSEN 2007, Tehran, Iran, April 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-75697-2/pbk). Lecture Notes in Computer Science 4767, 223-239 (2007).
Summary: We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining data exchanges in terms of sets of service partner names attachable to each single datum. Service programmers explicitly write only the annotations necessary to specify the wanted policies for communicable data, while a type inference system (statically) derives the minimal additional annotations that ensure consistency of services initial configuration. Then, the language dynamic semantics only performs very simple checks to authorize or block communication. We prove that the type system and the operational semantics are sound. As a consequence, we have the following data protection property: services always comply with the policies regulating the exchange of data among interacting services. We illustrate our approach through a simplified but realistic scenario for a service-based electronic marketplace.
For the entire collection see [Zbl 1138.68001].
Reviewer: Reviewer (Berlin)

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68M10 Network design and communication in computer systems
Full Text: DOI