Graph neural network-based mutation-aware regression test ordering using code dependency graphs and execution traces

The mutation-aware test prioritisation system in this paper uses Graph Neural Networks (GNNs) to combine static program structure, dynamic execution traces, and mutation coverage into a hybrid graph representation to enhance regression testing. The framework embeds higher-order dependencies in test cases using GCN, GAT, and GraphSAGE variations and ranks them using a multi-objective optimisation function that balances fault detection, execution cost, and mutation coverage. On benchmark datasets like Defects4J and ManySStuBs4J, the proposed approach consistently outperforms traditional baselines (coverage-based APFD = 72.4 %, cost-based = 74.5 %) and ML baselines (LSTM = 80.1 %, RL = 82.7 %), achieving an average APFD of 88.9 % and mutation score of 84.6 % with a 16.1-second execution overhead. Statistical tests (Wilcoxon signed-rank, <i>p</i> < 0.05) indicate the robustness of these gains. Ablation experiments show that removing execution traces or mutation characteristics reduces APFD by 5-8 %, emphasising their relevance. Qualitative research shows that GNN embeddings cluster fault-related test cases for interpretable prioritisation. The suggested paradigm for contemporary regression testing is scalable, accurate, and mutation-driven.•<b>Multi-Tiered Graph-Based Architecture</b>: The method transforms raw program artifacts (codebase, mutants, test traces) into Program Dependence Graphs and Call Graphs, where nodes represent program elements and edges capture dependencies enriched with runtime characteristics.•<b>GNN-Powered Multi-Objective Optimization</b>: Core innovation uses Graph Neural Networks (GCN, GAT, GraphSAGE) to create enriched embeddings through iterative neighborhood aggregation, feeding into a scoring function that balances fault detection potential, execution cost, and mutation coverage.•<b>Superior Validated Performance</b>: Achieves 88.9 % APFD compared to 82.7 % for best baseline methods on real-world datasets, with statistical significance confirmed through Wilcoxon signed-rank tests across multiple evaluation metrics.

Authors

Institutions

Publication Details

Journal
MethodsX
Published
2025-12-25
DOI
https://doi.org/10.1016/j.mex.2025.103782
Primary Topic
Software Testing and Debugging Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Graph neural network-based mutation-aware regression test ordering using code dependency graphs and execution traces

Anna Alphy, S Sowmyadevi
MethodsX
Software Testing and Debugging Techniques
article

Graph neural network-based mutation-aware regression test ordering using code dependency graphs and execution traces

Anna Alphy, S Sowmyadevi
article en

Abstract

The mutation-aware test prioritisation system in this paper uses Graph Neural Networks (GNNs) to combine static program structure, dynamic execution traces, and mutation coverage into a hybrid graph representation to enhance regression testing. The framework embeds higher-order dependencies in test cases using GCN, GAT, and GraphSAGE variations and ranks them using a multi-objective optimisation function that balances fault detection, execution cost, and mutation coverage. On benchmark datasets like Defects4J and ManySStuBs4J, the proposed approach consistently outperforms traditional baselines (coverage-based APFD = 72.4 %, cost-based = 74.5 %) and ML baselines (LSTM = 80.1 %, RL = 82.7 %), achieving an average APFD of 88.9 % and mutation score of 84.6 % with a 16.1-second execution overhead. Statistical tests (Wilcoxon signed-rank, <i>p</i> < 0.05) indicate the robustness of these gains. Ablation experiments show that removing execution traces or mutation characteristics reduces APFD by 5-8 %, emphasising their relevance. Qualitative research shows that GNN embeddings cluster fault-related test cases for interpretable prioritisation. The suggested paradigm for contemporary regression testing is scalable, accurate, and mutation-driven.•<b>Multi-Tiered Graph-Based Architecture</b>: The method transforms raw program artifacts (codebase, mutants, test traces) into Program Dependence Graphs and Call Graphs, where nodes represent program elements and edges capture dependencies enriched with runtime characteristics.•<b>GNN-Powered Multi-Objective Optimization</b>: Core innovation uses Graph Neural Networks (GCN, GAT, GraphSAGE) to create enriched embeddings through iterative neighborhood aggregation, feeding into a scoring function that balances fault detection potential, execution cost, and mutation coverage.•<b>Superior Validated Performance</b>: Achieves 88.9 % APFD compared to 82.7 % for best baseline methods on real-world datasets, with statistical significance confirmed through Wilcoxon signed-rank tests across multiple evaluation metrics.

MethodsXVol. 16
Institute of Management Technology (IN)
Industry, innovation and infrastructure
Openalex Percentile: Top 31%
Software Testing and Debugging Techniques
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.