loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems
Progressive Ranking and Composition of Web Services Using Covering Arrays
Sedona, Arizona
February 02-February 04
ISBN: 0-7695-2347-1
Charles J. Colbourn, Department of Computer Science and Engineering, Arizona State University,Tempe, AZ.
Yinong Chen, Department of Computer Science and Engineering, Arizona State University,Tempe, AZ.
Wei-Tek Tsai, Department of Computer Science and Engineering, Arizona State University,Tempe, AZ.

Major computer companies and government agencies are adopting Web Services (WS) technology. Web services must ensure interoperability and security, and be reliable and trustworthy. Consumers must make runtime decisions based on an intelligent and unbiased evaluation. We propose one component of a test suite generator to address this critical issue. The goal is to transform the labor-intensive software development process into a largely automated web services development process. The method operates within a service-oriented architecture, with the models and tools implemented as services that can be added, removed and replaced at runtime. We propose a generic greedy algorithm based on covering arrays for application in this environment.

Citation:
Charles J. Colbourn, Yinong Chen, Wei-Tek Tsai, "Progressive Ranking and Composition of Web Services Using Covering Arrays," words, pp.179-185, 10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems, 2005
Usage of this product signifies your acceptance of the Terms of Use.