A behavioral notion of subtyping
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the criteria to be used in decomposing systems into modules
Communications of the ACM
Service components for managing the life-cycle of service compositions
Information Systems - Special issue: The 14th international conference on advanced information systems engineering (CAiSE*02)
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
A View Based Analysis on Web Service Registries
Distributed and Parallel Databases
Adaptive Service Composition in Flexible Processes
IEEE Transactions on Software Engineering
Hierarchical Clustering for Software Architecture Recovery
IEEE Transactions on Software Engineering
Similarity search for web services
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Discovering Web Services in Search Engines
IEEE Internet Computing
A framework for QoS-aware binding and re-binding of composite web services
Journal of Systems and Software
Qos-driven runtime adaptation of service oriented architectures
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Towards Autonomic Service Discovery A Survey and Comparison
SCC '09 Proceedings of the 2009 IEEE International Conference on Services Computing
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
An integrated development and runtime environment for the future internet
The Future Internet
Hi-index | 0.00 |
Several lines of research rely on the concept of service abstractions to enable the organization, the composition and the adaptation of services. However, what is still missing, is a systematic approach for extracting service abstractions out of the vast amount of services that are available all over the Web. To deal with this issue, we propose an approach for mining service abstractions, based on an agglomerative clustering algorithm. Our experimental findings suggest that the approach is promising and can serve as a basis for future research.