Communication and Concurrency
Information and Computation
A theory of contracts for web services
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CONCUR '07 Proceedings of the 18th international conference on Concurrency Theory
Structured communication-centred programming for web services
ESOP'07 Proceedings of the 16th European conference on Programming
Contract based multi-party service composition
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Towards a unifying theory for choreography conformance and contract compliance
SC'07 Proceedings of the 6th international conference on Software composition
Choreography and orchestration: a synergic approach for system design
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
A formal account of contracts for web services
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Choreography and orchestration conformance for system design
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Contract-Based Discovery and Composition of Web Services
Formal Methods for Web Services
Commitment-based protocols with behavioral rules and correctness properties of MAS
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
Fair subtyping for multi-party session types
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Safe distribution of declarative processes
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Declarative modelling and safe distribution of healthcare workflows
FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems
Constraints for service contracts
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
Architectural Styles for Distributed Interoperability
Information Resources Management Journal
| Hi-index | 0.00 |
We investigate, in a process algebraic setting, a new notion of correctness for service compositions, which we call strong service compliance: composed services are strong compliant if their composition is both deadlock and livelock free (this is the traditional notion of compliance), and whenever a message can be sent to invoke a service, it is guranteed to be ready to serve the invocation. We also define a new notion of refinement, called strong subcontract pre-order, suitable for strong compliance: given a composition of strong compliant services, we can replace any service with any other service in subcontract relation while preserving the overall strong compliance. Finally, we present a characterisation of the strong subcontract pre-order by resorting to the theory of a (should) testing pre-order.