• DocumentCode
    496900
  • Title

    Simplify Test Requirement Suite Automatically by Adjacency List

  • Author

    Su, Jianyuan ; Han, Yun ; Lingling Wang ; Hao, Jianyuan ; Kuang, Xiaojin ; Zhao, Xin ; Liang, Hongyan

  • Author_Institution
    Coll. of Electr. Eng., Hohai Univ., Nanjing, China
  • Volume
    1
  • fYear
    2009
  • fDate
    18-19 July 2009
  • Firstpage
    518
  • Lastpage
    521
  • Abstract
    Simplifying test requirement suite is helpful for optimizing test case suite, as is proposed in this paper, it bases on adjacency list. Primarily, confirmed the test requirements and generated the initial test case suite according to program flow diagram, then drew the directed graph of relationships of test requirements and its corresponding adjacency list, analyzed its relationships between head-node and linked-list-node, finally simplified the requirements. It is indicated by the example that this algorithm could eliminate the relationships of equivalence and inclusion in test requirements automatically and reserve the mutually exclusive relationships and so on. Correctness and validity are demonstrated by the result of calculation corresponding to the one of manual analysis.
  • Keywords
    data flow analysis; data structures; directed graphs; formal specification; program testing; adjacency list; directed graph; head-node; linked-list-node; mutually exclusive relationship; program flow diagram; test case suite; test requirement suite; Algorithm design and analysis; Artificial neural networks; Automatic testing; Computational intelligence; Educational institutions; Information processing; Logic testing; Adjacency list; directed graph; program flow diagram; test case; test requirement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Processing, 2009. APCIP 2009. Asia-Pacific Conference on
  • Conference_Location
    Shenzhen
  • Print_ISBN
    978-0-7695-3699-6
  • Type

    conf

  • DOI
    10.1109/APCIP.2009.133
  • Filename
    5197107