A metamorphic relation recommendation method utilizing program syntax and semantic similarity

Metamorphic testing is a valuable approach for addressing the oracle problem, with the identification of metamorphic relations being a crucial task. Despite the availability of metamorphic relations in previously studied programs, many current studies do not leverage them, resulting in inefficiencies and reliability challenges when identifying metamorphic relations in new programs. SimiMR proposes the recommendation of verified metamorphic relations for new code by leveraging similarities with existing programs. This approach is based on the assumption that akin programs exhibit akin metamorphic relations, thus linking program similarity with metamorphic relations classification: semantic similarity corresponds with physical and computational model metamorphic relations, whereas syntactic similarity corresponds with code model ones. Experiments demonstrate that metamorphic relations in code models are effectively reusable among programs with similar syntax, whereas those in physical or computational models can be applied to semantically similar programs. SimiMR surpasses AutoMR and similar methods by enhancing identification efficiency, extending applicability, and minimizing redundancy. It operates with minimal domain knowledge, leverages existing metamorphic relations, and keeps identification costs low.

Authors

Institutions

Publication Details

Journal
Journal of King Saud University - Computer and Information Sciences
Published
2026-02-25
DOI
https://doi.org/10.1007/s44443-026-00597-7
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A metamorphic relation recommendation method utilizing program syntax and semantic similarity

Shiyu Yan, Jie Liu, Meng Li, Zhuting Luo et al.
Journal of King Saud University - Computer and Information Sciences
Logic, programming, and type systems
article

A metamorphic relation recommendation method utilizing program syntax and semantic similarity

Shiyu Yan, Jie Liu, Meng Li, Zhuting Luo, Tao Yu, Xiaohua Yang, Yin Zhao
article en

Abstract

Metamorphic testing is a valuable approach for addressing the oracle problem, with the identification of metamorphic relations being a crucial task. Despite the availability of metamorphic relations in previously studied programs, many current studies do not leverage them, resulting in inefficiencies and reliability challenges when identifying metamorphic relations in new programs. SimiMR proposes the recommendation of verified metamorphic relations for new code by leveraging similarities with existing programs. This approach is based on the assumption that akin programs exhibit akin metamorphic relations, thus linking program similarity with metamorphic relations classification: semantic similarity corresponds with physical and computational model metamorphic relations, whereas syntactic similarity corresponds with code model ones. Experiments demonstrate that metamorphic relations in code models are effectively reusable among programs with similar syntax, whereas those in physical or computational models can be applied to semantically similar programs. SimiMR surpasses AutoMR and similar methods by enhancing identification efficiency, extending applicability, and minimizing redundancy. It operates with minimal domain knowledge, leverages existing metamorphic relations, and keeps identification costs low.

Journal of King Saud University - Computer and Information Sciences
Hainan University (CN), University of South China (CN)
Openalex Percentile: Top 47%
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.