arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.06863cs.SE
收藏

矩阵计算程序的变形关系预测

Predicting Metamorphic Relation for Matrix Calculation Programs

Karishma Rahman, Upulee Kanewala

摘要:

矩阵通常代表科学应用中的重要信息,并参与执行复杂的计算。但是由于oracle问题,系统地测试这些应用程序是很困难的。变形测试是一种有效的方法来测试这样的应用程序,因为它使用变形关系来确定测试用例是否通过或失败。变形关系通常是在领域专家的帮助下识别的,并且是一项劳动密集型任务。在这项工作中,我们使用基于图核的机器学习方法来预测矩阵计算程序的变形关系。以前,这种基于图核的机器学习方法被用于成功地预测执行数值计算的程序的变形关系。研究结果表明,该方法也可用于预测矩阵计算程序的变形关系。

英文摘要:

Matrices often represent important information in scientific applications and are involved in performing complex calculations. But systematically testing these applications is hard due to the oracle problem. Metamorphic testing is an effective approach to test such applications because it uses metamorphic relations to determine whether test cases have passed or failed. Metamorphic relations are typically identified with the help of a domain expert and is a labor intensive task. In this work we use a graph kernel based machine learning approach to predict metamorphic relations for matrix calculation programs. Previously, this graph kernel based machine learning approach was used to successfully predict metamorphic relations for programs that perform numerical calculations. Results of this study show that this approach can be used to predict metamorphic relations for matrix calculation programs as well.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑