Coordinating interaction patterns
Proceedings of the 2001 ACM symposium on Applied computing
Generating adapters for concurrent component protocol synchronisation
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Using Model Checking to Generate Tests from Specifications
ICFEM '98 Proceedings of the Second IEEE International Conference on Formal Engineering Methods
Generating test cases for web services using data perturbation
ACM SIGSOFT Software Engineering Notes
Automated Model Checking and Testing for Composite Web Services
ISORC '05 Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Towards a BPEL unit testing framework
Proceedings of the 2006 workshop on Testing, analysis, and verification of web services and applications
A Counter-Example Testing Approach for Orchestrated Services
ICST '10 Proceedings of the 2010 Third International Conference on Software Testing, Verification and Validation
IEEE Software
When are two web services compatible?
TES'04 Proceedings of the 5th international conference on Technologies for E-Services
PiDuce: a process calculus with native XML datatypes
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
| Hi-index | 0.00 |
This paper provides a notation of protocol compatibility among services and describe how this can be useful to test interoperability in Service-Based Applications (SBA). Indeed, the features of a SBA, like distribution and loosely-coupling make usual testing techniques inefficient, especially when the choreography model is adopted. We argue that only the service interface description is not enough to prove and test compatibility among services. Services behavior should also be described. In this paper we introduce a formal model based on message-exchange that should fit for it, considering a service as a non-deterministic finite state automaton. According to this model, we can finally discuss a definition of protocol compatibility and its role for test generation.