• DocumentCode
    2297697
  • Title

    Constructing Prioritized Interaction Test Suite with Interaction Relationship

  • Author

    Yuan, Jianjun ; Jiang, Zuowen

  • Author_Institution
    Key Lab. of "Embedded Syst. & Service Comput." Minist. of Educ. of China, Tongji Univ., Shanghai, China
  • Volume
    3
  • fYear
    2010
  • fDate
    6-7 March 2010
  • Firstpage
    181
  • Lastpage
    184
  • Abstract
    Interaction testing has addressed some issues on how to select a small subset of test cases. In many systems where interaction testing is needed, the entire test suite is not executed because of time or budget constraints. It is important to prioritize the test cases in these situations. On the other hand, there are not always interactions among any factors in real systems. Moreover, some factors may need N-way (N>2) testing since there is a closer relationship among them. We present a model for prioritized interaction testing with interaction relationship and propose a greedy algorithm for generating variable strength covering arrays with bias.
  • Keywords
    greedy algorithms; program testing; budget constraints; greedy algorithm; interaction relationship; interaction testing; prioritized interaction test suite; software testing; variable strength; Computer science; Computer science education; Costs; Educational technology; Embedded computing; Embedded system; Greedy algorithms; Laboratories; Software testing; System testing; covering arrays; greedy algorithm; software interaction testing; test prioritization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Education Technology and Computer Science (ETCS), 2010 Second International Workshop on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-1-4244-6388-6
  • Electronic_ISBN
    978-1-4244-6389-3
  • Type

    conf

  • DOI
    10.1109/ETCS.2010.239
  • Filename
    5459713