TY  - CHAP
ED  - Arbab, Farhad
ED  - Sirjani, Marjan
SN  - 978-3-540-75697-2
EP  - 239
ID  - eprints417
N2  - 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. 
PB  - Springer
T2  - International Symposium on Fundamentals of Software Engineering (FSEN 2007)
AV  - public
N1  - ©Springer-Verlag Berlin Heidelberg 2007. The original publication is available at www.springerlink.com
T3  - Lecture Notes in Computer Science
SP  - 223
TI  - Regulating Data Exchange in Service Oriented Applications
Y1  - 2007///
UR  - http://dx.doi.org/10.1007/978-3-540-75698-9_15
A1  - Lapadula, Alessandro
A1  - Pugliese, Rosario
A1  - Tiezzi, Francesco
M1  - 4767
ER  -