基于等价模状态的快速变异分析
Faster Mutation Analysis via Equivalence Modulo States
摘要:
变异分析有许多应用,例如断言测试集的质量和定位故障。突变分析的一个重要瓶颈是可扩展性。最新的工作探讨了通过分流执行减少冗余执行的可能性。然而,分流执行只能在第一个变异语句之前删除冗余执行。在本文中,我们还试图减少第一个变异语句执行后的一些冗余执行。我们观察到,尽管许多变异语句不等价,但这些变异语句的执行结果仍然可能等价于原始语句的结果。换句话说,这些语句对当前状态取模是等价的。在本文中,我们提出了一种快速突变分析方法,AccMut。AccMut自动检测语句及其变化之间的等价模状态,然后将语句分组为等价类模状态,并且仅使用一个进程来表示每个类。通过这种方式,我们可以大大减少拆分进程的数量。我们的实验表明,我们的方法可以进一步加速突变分析的顶部分裂流执行的平均加速比为2.56倍。
英文摘要:
Mutation analysis has many applications, such as asserting the quality of test suites and localizing faults. One important bottleneck of mutation analysis is scalability. The latest work explores the possibility of reducing the redundant execution via split-stream execution. However, split-stream execution is only able to remove redundant execution before the first mutated statement. In this paper we try to also reduce some of the redundant execution after the execution of the first mutated statement. We observe that, although many mutated statements are not equivalent, the execution result of those mutated statements may still be equivalent to the result of the original statement. In other words, the statements are equivalent modulo the current state. In this paper we propose a fast mutation analysis approach, AccMut. AccMut automatically detects the equivalence modulo states among a statement and its mutations, then groups the statements into equivalence classes modulo states, and uses only one process to represent each class. In this way, we can significantly reduce the number of split processes. Our experiments show that our approach can further accelerate mutation analysis on top of split-stream execution with a speedup of 2.56x on average.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。