• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Software Maintenance and Evolution >Test Re-Prioritization in Continuous Testing Environments
【24h】

Test Re-Prioritization in Continuous Testing Environments

机译：在连续测试环境中测试重新定位

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

New changes are constantly and concurrently being made to large software systems. In modern continuous integration and deployment environments, each change requires a set of tests to be run. This volume of tests leads to multiple test requests being made simultaneously, which warrant prioritization of such requests. Previous work on test prioritization schedules queued tests at set time intervals. However, after a test has been scheduled it will never be reprioritized even if new higher risk tests arrive. Furthermore, as each test finishes, new information is available which could be used to reprioritize tests. In this work, we use the conditional failure probability among tests to reprioritize tests after each test run. This means that tests can be reprioritized hundreds of times as they wait to be run. Our approach is scalable because we do not depend on static analysis or coverage measures and simply prioritize tests based on their co-failure probability distributions. We named this approach CODYNAQ and in particular, we propose three prioritization variants called CODYNAQSINGLE, CODYNAQDOUBLE and CODYNAQFLEXI. We evaluate our approach on two data sets, CHROME and Google testing data. We find that our co-failure dynamic re-prioritization approach, CODYNAQ, outperforms the default order, FIFOBASELINE, finding the first failure and all failures for a change request by 31% and 62% faster, respectively. CODYNAQ also outperforms GOOGLETCP by finding the first failure 27% faster and all failures 62% faster.
机译：对大型软件系统不断和同时进行新的更改。在现代持续集成和部署环境中，每个变更都需要运行一组测试。此测试量导致同时进行多个测试请求，这是根据此类请求的优先级排序。以前的测试优先级顺序在设定时间间隔时提出排队测试。但是，在预定测试后，即使新的风险测试到达，也不会重新提出。此外，随着每个测试完成，可以使用新信息，这些信息可用于恢复测试。在这项工作中，我们在每个测试运行后，我们使用测试之间的有条件失败概率进行严格策重测试。这意味着测试可以在等待运行时重大估计数百次。我们的方法是可扩展的，因为我们不依赖于静态分析或覆盖措施，并根据其共失败概率分布简单地确定测试。我们将此方法命名为CODYNAQ，特别是，我们提出了三个称为Codynaqsingle，Codynaqdouble和Codynaqflexi的优先级差异。我们在两个数据集，Chrome和Google测试数据上评估我们的方法。我们发现，我们的共同失败动态重新定位方法CODYNAQ，优于默认订单，FIFOBASLENIT，查找第一个故障和所有失败，分别更快地提高31％和62％。 CODYNAQ还以更快的27％找到的第一个失败而优于GOOGLETCP，并且所有失败速度较快62％。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号