Biased covering arrays for progressive ranking and composition of Web Services

Renée C. Bryce, Yinong Chen, Charles Colbourn

Research output: Contribution to journalArticle

13 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)80-87
Number of pages8
JournalInternational Journal of Simulation and Process Modelling
Volume3
Issue number1-2
DOIs
StatePublished - 2007

Fingerprint

Covering Array
Group Testing
Web services
Web Services
Biased
Ranking
Testing
Chemical analysis
Service-oriented Computing
Greedy Algorithm
Software Development
Expand
Software engineering
Choose
Paradigm
Subset
Methodology
Costs

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 journalArticle

@article{32a9bb9e66ea48548c954c00bd308df7,
title = "Biased covering arrays for progressive ranking and composition of Web Services",
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.",
keywords = "Biased covering arrays, Covering arrays, Group testing, Mixed-level covering arrays, Pair-wise interaction testing, Reliability, Service-oriented architecture, Web services, WS",
author = "Bryce, {Ren{\'e}e C.} and Yinong Chen and Charles Colbourn",
year = "2007",
doi = "10.1504/IJSPM.2007.014717",
language = "English (US)",
volume = "3",
pages = "80--87",
journal = "International Journal of Simulation and Process Modelling",
issn = "1740-2123",
publisher = "Inderscience Enterprises Ltd",
number = "1-2",

}

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 -