Progressive ranking and composition of Web services using covering arrays

• Published in: 10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems pp. 179 - 185
• Main Authors: Colbourn, C.J., Yinong Chen, Wei-Tek Tsai
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2005
• Subjects: Certification; Computer science; Government; Programming; Reliability engineering; Runtime; Simple object access protocol; Testing; Web and internet services; Web services
• ISBN: 9780769523477; 0769523471
• ISSN: 1530-1443
• DOI: 10.1109/WORDS.2005.47

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.