Adaptive software testing with fixed-memory feedback

Cai, Kai-Yuan; Bo, Gu; Hu, Hefei; Li, Yongchao

doi:10.1016/j.jss.2006.11.008

Cited by 44 publications

(32 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By statistical repeatability it is meant that the corresponding conclusions are drawn from the experimental results generated from multiple trials and thus can recur if the experiment is re-conducted. The software experimentation paradigm with statistical repeatability was proposed in our previous work [7] and led to convincing conclusions and unexpected findings [9][10][11]. Note that the experiment described in Ref.…”

Section: Experimentation Paradigmmentioning

confidence: 84%

Software execution processes as an evolving complex network☆

Cai

Yin

2009

Information Sciences

Self Cite

View full text Add to dashboard Cite

Section: Experimentation Paradigmmentioning

confidence: 84%

Software execution processes as an evolving complex network☆

Cai

Yin

2009

Information Sciences

Self Cite

View full text Add to dashboard Cite

“…A related technique, known as adaptive testing, has been developed by Cai et al [10] with a different objective and approach. Adaptive testing adjusts the selections of test actions online following the idea of adaptive control, to achieve an optimization objective, such as minimizing the total cost of detecting and removing multiple faults.…”

Section: Introductionmentioning

confidence: 99%

“…The partitioning is made off-line. It has been shown that partitioning strategies can have a significant impact on the total cost of testing [10].…”

Section: Introductionmentioning

confidence: 99%

Improving Software Testing Cost-Effectiveness through Dynamic Partitioning

Zhi

Sinaga

Zhao

et al. 2009

2009 Ninth International Conference on Quality Software

Self Cite

View full text Add to dashboard Cite

We present a dynamic partitioning strategy that selects test cases using online feedback information. The presented strategy differs from conventional approaches. Firstly, the partitioning is carried out online rather than off-line. Secondly, the partitioning is not based on program code or specifications; instead, it is simply based on the fail or pass information of previously executed test cases and, hence, can be implemented in the absence of the source code or specification of the program under test. The cost-effectiveness of the proposed strategy has been empirically investigated with three programs, namely SPACE, SED, and GREP. The results show that the proposed strategy achieves a significant saving in terms of total number of test cases executed to detect all faults. Abstract-We present a dynamic partitioning strategy that selects test cases using online feedback information. The presented strategy differs from conventional approaches. Firstly, the partitioning is carried out online rather than off-line. Secondly, the partitioning is not based on program code or specifications; instead, it is simply based on the fail or pass information of previously executed test cases and, hence, can be implemented in the absence of the source code or specification of the program under test. The cost-effectiveness of the proposed strategy has been empirically investigated with three programs, namely SPACE, SED, and GREP. The results show that the proposed strategy achieves a significant saving in terms of total number of test cases executed to detect all faults. Disciplines Physical Sciences and Mathematics

show abstract

“…This strategy is proposed by Cai et al [8]. The software under test is modeled as a Markov chain under control.…”

Section: Introductionmentioning

confidence: 99%