Higher Order Mutation (HOM) has been proposed to avoid equivalent mutants and improve the scalability of mutation testing, but generating useful HOMs remain an expensive search problem on its own. We propose a new approach to generate Strongly Subsuming Higher Order Mutants (SSHOM) using a recently introduced Causal Program Dependence Analysis (CPDA). CPDA itself is based on program mutation, and provides quantitative estimation of how often a change of the value of a program element will cause a value change of another program element. Our SSHOM generation approach chooses pairs of program elements using heuristics based on CPDA analysis, performs First Order Mutation to the chosen pairs, and generates an HOM by combining two FOMs.
翻译:为了避免等效变异体,提高突变测试的可缩放性,建议了高级命令性突变(HOM),但产生有用的HOMs本身仍然是一个昂贵的搜索问题。 我们建议了一种新的方法,利用最近推出的“因果方案依赖性分析(CPDA) ” ( SSHOM ), 来产生“强制高级命令性突变(SSHOM ) ” ( SSHOM ) 。 CPDA 本身以程序突变为基础,并对一个程序要素的价值变化会如何经常导致另一个程序要素的价值变化进行定量估计。 我们的SSHOM 生成方法根据CPA 分析,选择了两对黑素元素,对所选的夫妇进行第一种命令性突变,并将两个FOM 组合产生一个HOM 。