SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Software—Practice & Experience - Special issue on aliasing in object-oriented systems
Types for the ambient calculus
Information and Computation - IFIP TCS2000
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Lightweight confinement for featherweight java
OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
A generic type system for the Pi-calculus
Theoretical Computer Science
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparing two approaches to compensable flow composition
CONCUR 2005 - Concurrency Theory
Confining data and processes in global computing applications
Science of Computer Programming - Special issue on security issues in coordination models, languages, and systems
A Calculus of Global Interaction based on Session Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Formal Foundation to Orchestration Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Formalizing Web Service Choreographies
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
SOCK: a calculus for service oriented computing
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Resource usage analysis for the π-calculus
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Foundations of web transactions
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Choreography and orchestration conformance for system design
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
A WSDL-based type system for WS-BPEL
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Security issues in service composition
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Service Discovery and Negotiation With COWS
Electronic Notes in Theoretical Computer Science (ENTCS)
Specifying and Analysing SOC Applications with COWS
Concurrency, Graphs and Models
Relational Analysis of Correlation
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Specification and Analysis of SOC Systems Using COWS: A Finance Case Study
Electronic Notes in Theoretical Computer Science (ENTCS)
A Symbolic Semantics for a Calculus for Service-Oriented Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
From Architectural to Behavioural Specification of Services
Electronic Notes in Theoretical Computer Science (ENTCS)
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
An accessible verification environment for UML models of services
Journal of Symbolic Computation
Core calculi for service-oriented computing
Rigorous software engineering for service-oriented systems
The SENSORIA approach applied to the finance case study
Rigorous software engineering for service-oriented systems
Using formal methods to develop WS-BPEL applications
Science of Computer Programming
Hi-index | 0.00 |
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.