一句话：提出自动识别不可行测试需求的方法，并计划用搜索式算法自动化处理顺序与并发程序中的不可行性。
软件测试对质量保障至关重要，但在结构测试中，许多测试需求因程序不可执行而不可行，导致测试成本与工作量上升。并发程序测试还引入非确定性，使同一输入可能产生不同输出，令不可行测试需求识别更复杂。该博士项目计划定义一种自动识别不可行测试需求的方法：识别导致不可行性的属性，并自动化这些属性的应用；同时拟采用基于搜索的算法，对顺序与并发程序的处理进行自动化。摘要未报告具体实验结果，属于项目提案。
Software testing activity is imperative to improve software quality. However, finding a set of test cases satisfies a given test criterion, is not a trivial task because the overall input domain is very large, and different test sets can be derived, with different effectiveness. In the context of structural testing, the non-executability is a feature present in most programs, increasing cost and effort of testing activity. When concurrent programs are tested, new challenges arise, mainly related to the non-determinism. Non-determinism can result in different possible test outputs for the same test input, which makes the problem of non-executability more complex, requiring treatment. In this sense, our project intends to define an approach to support automatic identification of infeasible testing requirements. Hence, this proposal aims to identify properties which cause infeasible testing requirements and automate their application. Due to complexity of the problem, we will apply search-based algorithms in the automation of concurrent and sequential programs treatment.
DOI 原文 ·
@inproceedings{paperbot6080,
title = {Automatic support for the identification of infeasible testing requirements},
author = {João Choma Neto},
booktitle = {ISSTA},
year = {2020},
doi = {10.1145/3395363.3402646}
}