The paper establishes a support-set domination boundary governed by kill-signature heterogeneity that separates when class-level MR abstraction suffices from when mutant-level minimization is required, proving the Min-MR-Complete problem NP-hard via set-cover equivalence.
A semantic mutation metric for metamorphic relation adequacy in scientific computing pro- grams,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Minimum Complete MR Subsets under Semantic-Mutation Fault Models: A Support-Set Domination Boundary
The paper establishes a support-set domination boundary governed by kill-signature heterogeneity that separates when class-level MR abstraction suffices from when mutant-level minimization is required, proving the Min-MR-Complete problem NP-hard via set-cover equivalence.