ABAF-VP: Validation Planning for Android Bug Mechanisms

Validating a concrete Android bug requires more than choosing a tool category: the rule, inputs, and oracle must decide whether the target mechanism is present on the buggy version and absent on the fixed one. We present ABAF-VP, a validation-planning approach that profiles the target mechanism, filters and ranks candidate plans using mechanism, capability, oracle, and evidence predicates drawn from a 191-record knowledge base, aligns the selected rule to the concrete target, and verifies both artifact versions against an independent two-sided reference. On 100 formal tasks with independent human reference labels, ABAF-VP ranks a valid plan first for 10 of 13 jointly solvable tasks (P@1 = 76.9%), ahead of category, retrieval, and capability baselines; ablation attributes the gain mainly to mechanism matching (−69.2 pp when removed). Target-rule alignment raises paired verification on 60 bug/fix pairs from 5 to 47 (78.3%) and end-to-end task success from 5/100 to 47/100, adding 30.274 s of known machine time (5.5%). Results are bounded by a small solvable subset, manual alignment bindings, and documented capability limits. Within these bounds, validation planning offers an executable, evidence-aware path from Android bug-mechanism knowledge to concrete verification.