Abstract
Testing-based formal verification (TBFV) combines concrete execution with formal checking of represented program paths. Condition Sequence Coverage (CSC) and the Condition Case Tree (CCT) make this exploration systematic while controlling loop-induced growth. We present a CCT-centered framework that extends CSC-based TBFV in three ways. CSC+Boundary reconsiders ancestor-stopped obligations under a selected finite input constraint and classifies them as concrete, infeasible over the specification input domain, or range-excluded. Parallel CCT-frontier generation executes snapshot-visible candidates concurrently and merges their traces deterministically. Fold-the-Tree fault localization folds refined-TBFV outcomes, CCT topology, and assignment/return trace events into ranked condition and state-update candidates. We implement the framework in Java and evaluate it on 42 subjects and 252 retained mutants, 225 of which provide failure evidence for diagnosis. Bounded exploration leaves loop-free subjects unchanged and resolves all observed ancestor-stopped obligations in loop-bearing subjects. Across 210 loop-bearing mutants, CSC+Boundary increases the kill rate from 77.6% to 92.4%. With eight workers, parallel generation achieves mean and median speedups of 1.80× and 1.89×, while all canonical output fingerprints match across worker settings and repetitions. Under a matched source-line budget, the CCT-based composite has higher observed Top-1 and Top-2 hit rates than the strongest evaluated spectrum-based fault localization (SBFL) baseline and ties it at Top-3; after Holm correction, none of the paired differences is significant at the 0.05 level.

This publication has 15 references indexed in Scilit: