• DocumentCode
    2588800
  • Title

    Progressive ranking and composition of Web services using covering arrays

  • Author

    Colbourn, Charles J. ; Chen, Yinong ; Tsai, Wei-Tek

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA
  • fYear
    2005
  • fDate
    2-4 Feb. 2005
  • Firstpage
    179
  • Lastpage
    185
  • Abstract
    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.
  • Keywords
    Internet; greedy algorithms; open systems; software architecture; Web services; covering arrays; generic greedy algorithm; interoperability; security; service-oriented architecture; software development; Certification; Computer science; Government; Programming; Reliability engineering; Runtime; Simple object access protocol; Testing; Web and internet services; Web services;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Object-Oriented Real-Time Dependable Systems, 2005. WORDS 2005. 10th IEEE International Workshop on
  • ISSN
    1530-1443
  • Print_ISBN
    0-7695-2347-1
  • Type

    conf

  • DOI
    10.1109/WORDS.2005.47
  • Filename
    1544792