Skip to content

Understanding critical-class prioritization in class integration test order generation with a GNN-D3QN framework

Aug 2026 · Journal of King Saud University: Computer and Information Sciences · Vol 38 · 0 citations · 46 references

TL;DR

Investigation of when and why critical-class-first scheduling is effective in CITO and a GNN-D3QN joint framework is proposed to unify critical class identification and test order optimization suggests that the effectiveness of critical-class prioritization is structurally conditioned by the topological roles and distribution patterns of critical classes.

Abstract

Although critical-class prioritization has been introduced into Class Integration Test Order (CITO) generation, its effect on test stubbing complexity remains insufficiently understood. This study aims to investigate when and why critical-class-first scheduling is effective in CITO. A GNN-D3QN joint framework is proposed to unify critical class identification and test order optimization. Specifically, a graph neural network is employed to identify critical classes from software dependency graphs, and the resulting criticality scores are incorporated into the reward function of D3QN together with test stubbing complexity. A parameter λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document} is introduced to balance critical-class prioritization and stub-cost minimization. Experiments show that the proposed method can effectively identify critical classes and significantly change their positions in the generated test order. More importantly, the impact of critical-class prioritization on test cost is system-dependent: it reduces test cost in two systems, remains nearly neutral within a low-λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document} range in three systems, and degrades it in four systems. Further analysis suggests that the effectiveness of critical-class prioritization is structurally conditioned by the topological roles and distribution patterns of critical classes. It tends to reduce test cost when critical classes are concentrated in high in-degree, low out-degree positions or around a few upstream super-hubs, but may become counterproductive when critical classes simultaneously span upstream and downstream roles or are topologically dispersed. Critical-class-first scheduling is not a universally effective strategy in CITO, but a conditional optimization mechanism constrained by software dependency structure. In addition, it can provide search guidance for reinforcement learning by alleviating long-range credit assignment difficulty.

Read PDF

Similar papers

Preprint Aug 2026

Ockhamareto: Pareto-Gated Segment-Level Credit Assignment for Concise Unit-Test Generation with Reinforcement Learning

Ockhamareto is introduced, a single-shot GRPO framework for unit-test generation and selection, based on the principles of Ockham's Razor and Pareto Optimality, and it is shown that the knee point of the optimal trade-off between efficiency and effectiveness on the Pareto front is not correlated with obvious more easil...

Dong Huang, Mark Harman, Jie M. Zhang et al. · 3 citations
Open access Aug 2026

SLλ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${SL}^{\lambda }$$\end{document}: A Scalable Algorithm for Register

This article implements an effective and scalable register automata (RA) learning algorithm that significantly reduces the number of membership queries required for inferring models by up to an order of magnitude and achieves this by combining a tree-based cost-efficient data structure with mechanisms for computing sho...

Simon Dierl, P. Fiterău-Broştean, F. Howar et al. · 0 citations
Preprint Aug 2026

NetlistBench: Evaluating LLM Reliability in SPICE Netlist Recognition and Manipulation

NetlistBench identifies netlist reliability as a distinct bottleneck for trustworthy LLM-based circuit design automation as well as a structure-verified benchmark for SPICE netlist recognition and manipulation.

Jiarui Ma, Jianghan Wang, Yuheng Ma et al. · 1 citation
Open access Aug 2026

Riesz s\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varvec{s}$$\end{document}-Energy Regularized Bi-Objective Maxi

Experiments on ERBOMCLP instances derived from a real-world MCLP dataset show that the main memetic variant improves selected-solution coverage and often gives competitive or lower Riesz s-energy, while the spread of the Pareto front approximation remains instance dependent.

Soumen Atta, Michael T. M. Emmerich · 0 citations
Preprint Aug 2026

StateTune: Transforming LLM-Assisted EDA Flow Tuning into a Stateful, Closed-Loop Process

StateTune is presented, which reformulates LLM-assisted EDA tuning as a closed-loop, state-carrying process that achieves the strongest final hypervolume on all six benchmark blocks, showing a stable improvement in frontier quality across the full matrix.

Kunlong Li, Shang-Shang Yao, Su Zheng et al. · 0 citations
Open access Aug 2026

Concrete strength prediction using domain-driven feature engineering and explainable LightGBM

This study integrates domain-informed feature engineering with optimized tree-based ensemble models to benchmark concrete strength prediction on a widely recognized Yeh dataset, with SHAP analysis revealed that the newly engineered features were the most influential predictors.

Ahmed Hereiz, Mennatullah Elsahy, Kenzy Hassan et al. · 0 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.