Title page for etd-0723107-164956


[Back to Results | New Search]

URN etd-0723107-164956
Author Tsung-Han Tsai
Author's Email Address No Public.
Statistics This thesis had been viewed 5636 times. Download 17 times.
Department Information Management
Year 2006
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title A New Combinatorial Strategy to Black-box Testing with Constraints
Date of Defense 2007-06-25
Page Count 87
Keyword
  • Software testing
  • combinatorial testing
  • Black-box testing
  • CSP
  • Abstract In recent year, a lot of scholar try to generate test sets for combinatorial strategy automatically. But these algorithms based on combinatorial strategy don’t consider conflicts of input parameter model. A conflict exists when the result of combining two
    or more values of different parameter dose not make sense. Thus, invalid sub-combinations may be included in test cases in the test suite, and these are useless to us. Besides, these algorithms all directly generate all test cases once, in other words,
    it is unable to utilize test cases generated at present to feedback and revise the algorithm, so it is easy to generate useless combinations.
        So, this paper proposes new test generation algorithm for combinatorial testing based on constraint satisfaction problem(CSP) to solve problem which invalid sub-combinations may be included in test cases, and we can add constraints flexibly during generating test cases to avoid generate useless or repeated combinations. The experimental result indicate that our algorithm perform well, with respect to the amount of time required for test generation, otherwise, we can generate conflict-free
    test cases directly.
    Advisory Committee
  • Ching-Seh Wu - chair
  • Chih-Ping Chu - co-chair
  • Bingchiang Jeng - advisor
  • Chia-Mei Chen - advisor
  • Files
  • etd-0723107-164956.pdf
  • indicate in-campus access in a year and off_campus not accessible
    Date of Submission 2007-07-23

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys