A Novel Approach for Test Suite Reduction Based on Requirement Relation Contraction

被引：0
|
作者：
Chen, Zhenyu [1 ]
Xu, Baowen [1 ]
Zhang, Xiaofang [1 ]
Nie, Changhai [1 ]
机构：
[1] Southeast Univ, Sch Engn & Comp Sci, Nanjing, Peoples R China
来源：
APPLIED COMPUTING 2008, VOLS 1-3 | 2008年
关键词：
test case reduction; testing requirement optimization; graph contraction;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The goal of test suite reduction is to satisfy all testing requirements with the minimum number of test cases. Existing techniques can be applied well on the constructed test suite. However, it is possible and necessary to optimize testing requirements before test case generation. In this paper test suite reduction is solved by testing requirement optimization. A requirement relation graph is proposed to minimize the requirement set by graph contraction. An experiment on specification-based testing is designed and implemented. The empirical studies show that the testing requirements can be optimized by the graph contraction methods effectively.
引用
收藏
页码：390 / 394
页数：5
相关论文
共 50 条
  • [21] A New Approach to Feature-based Test Suite Reduction in Software Product Line Testing
    Gotlieb, Arnaud
    Carlsson, Mats
    Marijan, Dusica
    Petillon, Alexandre
    ICSOFT-EA: PROCEEDINGS OF THE 11TH INTERNATIONAL JOINT CONFERENCE ON SOFTWARE TECHNOLOGIES - VOL. 1, 2016, : 48 - 58
  • [22] An Incremental Approach for Model-based Test Suite Reduction Using Formal Concept Analysis
    Ng, Pin
    Fung, Richard Y. K.
    PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON UBIQUITOUS INFORMATION TECHNOLOGIES & APPLICATIONS (ICUT 2009), 2009, : 141 - +
  • [23] On the divide-and-conquer approach towards test suite reduction.
    Chen, TY
    Lau, MF
    INFORMATION SCIENCES, 2003, 152 : 89 - 119
  • [24] GASSER: A Multi-Objective Evolutionary Approach for Test Suite Reduction
    Coviello, Carmen
    Romano, Simone
    Scanniello, Giuseppe
    Antoniol, Giuliano
    INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING, 2022, 32 (02) : 193 - 225
  • [25] Empirically evaluating Greedy-based test suite reduction methods at different levels of test suite complexity
    Lin, Chu-Ti
    Tang, Kai-Wei
    Wang, Jiun-Shiang
    Kapfhammer, Gregory M.
    SCIENCE OF COMPUTER PROGRAMMING, 2017, 150 : 1 - 25
  • [26] A Study of Test Suite Reduction Based on Ant Lion Optimizer
    Wei, Wei
    Cheng, Weidong
    Ye, Li
    Xia, Shuibin
    Wang, Yueping
    Xing, Ying
    Wang, Xingde
    TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2022, 29 (01): : 246 - 251
  • [27] Considering Polymorphism in Change-Based Test Suite Reduction
    Parsai, Ali
    Soetens, Quinten David
    Murgia, Alessandro
    Demeyer, Serge
    AGILE METHODS: LARGE-SCALE DEVELOPMENT, REFACTORING, TESTING, AND ESTIMATION, 2014, 199 : 166 - 181
  • [28] A New Algorithm to Test Suite Reduction Based on Cluster Analysis
    Parsa, S.
    Khalilian, A.
    Fazlalizadeh, Y.
    2009 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, VOL 3, 2009, : 189 - 193
  • [29] Poster: CUTER: ClUstering-based TEst suite Reduction
    Coviello, Carmen
    Romano, Simone
    Scanniello, Giuseppe
    PROCEEDINGS 2018 IEEE/ACM 40TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING - COMPANION (ICSE-COMPANION, 2018, : 306 - 307
  • [30] Model-based Test Suite Reduction with Concept Lattice
    Ng, Pin
    Fung, Richard Y. K.
    PROCEEDINGS OF THE 2008 ADVANCED SOFTWARE ENGINEERING & ITS APPLICATIONS, 2008, : 3 - +
12345