Abstract
Service-oriented computing is a new software development paradigm that allows application builders to choose from many available services. The challenges are to efficiently determine which services are the most appropriate to combine into an application based on concerns such as functionalities, licensing costs, and known reliability. Group testing has addressed some issues on how to select a small subset of candidate services. We expand upon the group testing methodology with a greedy algorithm that generates biased covering arrays for interactive testing of the services selected by group testing.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 80-87 |
| Number of pages | 8 |
| Journal | International Journal of Simulation and Process Modelling |
| Volume | 3 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - 2007 |
Fingerprint
Keywords
- Biased covering arrays
- Covering arrays
- Group testing
- Mixed-level covering arrays
- Pair-wise interaction testing
- Reliability
- Service-oriented architecture
- Web services
- WS
ASJC Scopus subject areas
- Computer Science Applications
- Applied Mathematics
- Modeling and Simulation
Cite this
Biased covering arrays for progressive ranking and composition of Web Services. / Bryce, Renée C.; Chen, Yinong; Colbourn, Charles.
In: International Journal of Simulation and Process Modelling, Vol. 3, No. 1-2, 2007, p. 80-87.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Biased covering arrays for progressive ranking and composition of Web Services
AU - Bryce, Renée C.
AU - Chen, Yinong
AU - Colbourn, Charles
PY - 2007
Y1 - 2007
N2 - Service-oriented computing is a new software development paradigm that allows application builders to choose from many available services. The challenges are to efficiently determine which services are the most appropriate to combine into an application based on concerns such as functionalities, licensing costs, and known reliability. Group testing has addressed some issues on how to select a small subset of candidate services. We expand upon the group testing methodology with a greedy algorithm that generates biased covering arrays for interactive testing of the services selected by group testing.
AB - Service-oriented computing is a new software development paradigm that allows application builders to choose from many available services. The challenges are to efficiently determine which services are the most appropriate to combine into an application based on concerns such as functionalities, licensing costs, and known reliability. Group testing has addressed some issues on how to select a small subset of candidate services. We expand upon the group testing methodology with a greedy algorithm that generates biased covering arrays for interactive testing of the services selected by group testing.
KW - Biased covering arrays
KW - Covering arrays
KW - Group testing
KW - Mixed-level covering arrays
KW - Pair-wise interaction testing
KW - Reliability
KW - Service-oriented architecture
KW - Web services
KW - WS
UR - http://www.scopus.com/inward/record.url?scp=34748895481&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34748895481&partnerID=8YFLogxK
U2 - 10.1504/IJSPM.2007.014717
DO - 10.1504/IJSPM.2007.014717
M3 - Article
AN - SCOPUS:34748895481
VL - 3
SP - 80
EP - 87
JO - International Journal of Simulation and Process Modelling
JF - International Journal of Simulation and Process Modelling
SN - 1740-2123
IS - 1-2
ER -