arrow
返回

Adaptive Reward Computation in Reinforcement Learning-Based Continuous Integration Testing

delete2021-01-01
delete5
delete
OA
AI
Y
Yang Yang
C
Chaoyue Pan
李
李征 (Zheng Li) *
R
Ruilian Zhao
DOI:10.1109/ACCESS.2021.3063232delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Reinforcement learning (RL) has been applied to prioritizing test cases in Continuous Integration (CI) testing, where the reward plays a crucial role. It has been demonstrated that historical information-based reward function can improve the effectiveness of the test case prioritization (TCP). However, the inherent character of frequent iterations in CI can produce a considerable accumulation of historical information, which may decrease TCP efficiency and result in slow feedback. In this paper, the partial historical information is considered in the reward computation, where sliding window techniques are adopted to capture the possible efficient information. Firstly, the fixed-size sliding window is introduced to set a fixed length of recent historical information for each CI test. Then dynamic sliding window techniques are proposed, where the window size is continuously adaptive to each CI testing. Two methods are proposed, the test suite-based dynamic sliding window and the individual test case-based dynamic sliding window. The empirical studies are conducted on fourteen industrial-level programs, and the results reveal that under limited time, the sliding window-based reward function can effectively improve the TCP effect, where the NAPFD (Normalized Average Percentage of Faults Detected) and Recall of the dynamic sliding windows are better than that of the fixed-size sliding window. In particular, the individual test case-based dynamic sliding window approach can rank 74.18% failed test cases in the top 50% of the sorting sequence, with 1.35% improvement of NAPFD and 6.66 positions increased in TTF (Test to Fail).
Keyword:
Testing
Reinforcement learning
Optimization
Search problems
Licenses
Feature extraction
Fault detection
Continuous integration
test case prioritization
reinforcement learning
sliding window
reward computation
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

B
Beijing University of Chemical Technology
学者数:
3.1W
论文数: 2.2W
被引数: 4.5W
引用论文

引用论文

Surgicel mimics possible recurrence of hepatoblastoma
err1997-03-19
err0
PREAI
errIsla M. Lang; B. Connolly; Robert M. Filler
err分享
err收藏
err分享
err收藏
MMS observations of large guide field symmetric reconnection between colliding reconnection jets at the center of a magnetic flux rope at the magnetopause
err2016-06-04
err0
errOAAI
errM. Øieroset; T. D. Phan; C. Haggerty; M. A. Shay; J. P. Eastwood; D. J. Gershman; J. F. Drake; M. Fujimoto; R. E. Ergun; F. S. Mozer; M. Oka; R. B. Torbert; J. L. Burch; S. Wang; L. J. Chen; M. Swisdak; C. Pollock; J. C. Dorelli; S. A. Fuselier; B. Lavraud; B. L. Giles; T. E. Moore; Y. Saito; L. A. Avanov; W. Paterson; R. J. Strangeway; C. T. Russell; Y. Khotyaintsev; P. A. Lindqvist; K. Malakit
err分享
err收藏
学者 查看更多内容