Hong Kong, China
Oct. 30, 2000 to Oct. 31, 2000
T.H. Tse , University of Hong Kong
X. Feng , University of Hong Kong
T.Y. Chen , Swinburne University of Technology
Most research on weak mutation testing focuses on predicate statements. Relative little attention has been paid to arithmetic expressions. In this paper, we analyse the latter type of expression and prove that, given an atomic arithmetic expression, if it contains no variable or if the operator is the unary “++” or “--”, then a single test case is sufficient and necessary to kill any fundamental mutant; otherwise, two test cases are sufficient and necessary.
Arithmetic expressions, completeness of test cases, mutation operators, mutation testing, software testing
T.H. Tse, X. Feng, T.Y. Chen, "On the Completeness of Test Cases for Atomic Arithmetic Expressions", APAQS, 2000, Asia-Pacific Conference on Quality Software, Asia-Pacific Conference on Quality Software 2000, pp. 149, doi:10.1109/APAQ.2000.883788