Abstract
In this paper we propose a framework that reduces the complexity of service substitution. The framework is based on two substitution relations and corresponding theorems. The proposed relations and theorems allow organizing available services into groups. Then, the complexity of retrieving candidate substitute services for the target service and generating corresponding adapters scales up with the number of available groups, instead of scaling up with the number of available services.
Original language | English |
---|---|
Title of host publication | ASE2009 - 24th IEEE/ACM International Conference on Automated Software Engineering |
Pages | 555-559 |
Number of pages | 5 |
DOIs | |
Publication status | Published - 01 Dec 2009 |
Externally published | Yes |
Event | 24th IEEE/ACM International Conference on Automated Software Engineering, ASE2009 - Auckland, New Zealand Duration: 16 Nov 2009 → 20 Nov 2009 |
Conference
Conference | 24th IEEE/ACM International Conference on Automated Software Engineering, ASE2009 |
---|---|
Country/Territory | New Zealand |
City | Auckland |
Period | 16/11/2009 → 20/11/2009 |
ASJC Scopus subject areas
- Computer Science Applications
- Software