Principal Context-aware Diffusion Guided Data Augmentation for Fault Localization

Shihao Fu; Yan Lei

REVIEW 4 major objections 8 minor 48 references

Principal Context-aware Diffusion Guided Data Augmentation for Fault Localization

T0 review · 4 major / 8 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper claims that synthetic failing test cases generated by a program-context-aware diffusion model can rebalance imbalanced test suites and improve fault localization, reporting average Top-1 improvements of 383.83% across six…

desk verdict A new diffusion-based FL augmentation idea, undermined by an unsupported claim: synthetic 'failing tests' are never binarized or executed, so the headline gains are not yet evidence. read the letter →

arxiv 2505.24079 v1 pith:73ARIJ6F submitted 2025-05-29 cs.SE

Shihao Fu , Yan Lei This is my paper

classification cs.SE

keywords faultlocalizationdataaugmentationclassimbalancediffusionmodelprogramslicingprincipalcomponentanalysisspectrum-baseddeeplearning

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Fault localization relies on execution data from passing and failing tests, but real test suites are heavily skewed toward passing tests, and that skew degrades the rankings of faulty statements. This paper proposes a data-augmentation method, PCD-DAug, that uses a conditional diffusion model to synthesize additional failing test cases so the test suite becomes class-balanced. To keep the synthesized tests meaningful, the method first builds a principal context from dynamic program slicing (which statements influence the faulty output) and a revised PCA (statistical dependencies among statements), then feeds that fused context into a diffusion model trained to generate failing test cases. On 262 fault versions from five benchmark programs, the paper reports that six fault-localization methods improve on average by 383.83% at Top-1, 227.08% at Top-3, and 224.19% at Top-5 after augmentation, and that PCD-DAug outperforms six data-augmentation baselines. The value of the claim, if true, is that localization accuracy can be raised without changing the localization algorithm at all, only by balancing the test data it consumes.

What carries the argument

The central object is the principal context: a fused, dimensionality-reduced coverage matrix that keeps the statements most likely to explain a failure. It is built by dynamic program slicing over multiple failing test cases, which collects statements that influence the faulty output through data and control dependencies; by a revised PCA that ranks original statement columns by summed contributions to the top eigenvectors; and by a fusion algorithm that intersects the two statement index sets and then expands the intersection with PCA-ranked statements that also appear in the slice. The second component is the conditional diffusion model: a forward process adds Gaussian noise according to a fixed schedule, and a trainable reverse process denoises under classifier-free guidance to emit synthetic failing rows, with DPM-Solver replacing the slow denoising chain by a high-order ODE solver so that 25 sampling steps suffice. The key work of these components is to let the generator learn failure-relevant structure without the generator-discriminator instability of GAN-based augmentation and without needing per-dataset retuning of hyperparameters.

What would settle it

Pick one Defects4J version, rerun PCD-DAug, and attempt to realize each generated coverage row as an actual execution of the faulty program: if most rows do not correspond to any real failing run, or if the 383.83 percent Top-1 improvement disappears when only executed-and-verified failing cases are kept, the central claim is refuted.

Watch

Extended reading notes

Core claim

The paper's central claim is that class imbalance between passing and failing test cases is a removable obstacle: a diffusion model conditioned on a program-specific context can fabricate the missing failing cases well enough that spectrum-based and deep-learning fault localizers rank real faults much higher. PCD-DAug constructs the conditioning context in two halves: dynamic program slicing yields a semantic context of statements that drive the faulty output, and a revised PCA extracts a statistical context of the most influential coverage dimensions; an intersection-and-expansion fusion merges the two into a reduced coverage matrix. A simplified U-Net diffusion model with classifier-free guidance learns the distribution of failing and passing rows in that reduced space, and DPM-Solver sampling turns random noise into synthetic failing test cases until the failing class matches the passing class. The paper reports the resulting balanced datasets improve all six evaluated fault-localization approaches on Top-1, Top-3, Top-5, mean first rank, and mean average rank, with the largest relative gains on the deep-learning methods.

Load-bearing premise

The load-bearing premise is that every synthesized row the diffusion model emits is a real failing test case for the faulty program, even though the paper never executes those rows or shows how its continuous outputs are converted into the binary coverage vectors that fault localization consumes.

Editorial extensions

If this is right

Any of the six tested fault-localization methods can be upgraded simply by feeding in a balanced dataset; the augmentation does not touch the suspiciousness formula or network.
The reported mean-first-rank and mean-average-rank drops imply developers inspect far fewer statements: relative-improvement values for deep-learning methods fall below 16 percent of the original inspection effort for both metrics.
Balanced data from this generator beats undersampling, resampling, and four earlier augmentation approaches on most Top-K and ranking metrics.
A single hyperparameter configuration works across 262 versions and five programs, suggesting the method generalizes without per-dataset tuning.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Beyond the paper, the decisive unverified step is whether the generated rows are genuinely failing test cases: because the diffusion model outputs continuous coverage-like vectors and no thresholding or execution check is reported, the 383.83 percent Top-1 figure is an upper-bound claim until that step is validated.
Beyond the paper, the same principal-context-plus-diffusion recipe could be applied to other imbalanced software-engineering datasets, such as defect prediction or crash triage, though the paper does not evaluate those settings.
Beyond the paper, a direct extension would be to replace continuous-output binarization with a learned threshold, or to generate in a latent space as the paper names for future work, and then test whether the gains survive binarization at different cutoffs.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Short version: the idea—use a conditional diffusion model, conditioned on a fused dynamic-slice plus revised-PCA context, to synthesize minority failing spectra—is new in the FL augmentation niche and worth a look. The replication package is a plus. But the load-bearing claim is unsupported: the paper never says how continuous diffusion outputs become the binary coverage vectors that Dstar, Ochiai, etc. consume, and never executes or oracle-checks a single generated 'failing test case.' The label 'failing' is assigned by construction. Without that, the reported gains (including the 383.83% number in the abstract) could just be the effect of duplicating near-copies of real failing rows—something prior work has already shown can help. So the central experimental claim, as written, is not established.

What is genuinely new: the specific fusion of dynamic slicing with revised PCA as a conditioning context, and the move to diffusion models (rather than GAN/CVAE) for FL augmentation. The training only needs the reverse process, which is a reasonable practical advantage. The benchmark setup is broad: 262 Defects4J versions, six FL methods, six augmentation baselines. That is a solid evaluation scaffold.

The soft spots, in order of seriousness: 1. The binarization step is missing (Section 3.4, Algorithm 2). If the raw float rows are fed to SFL formulas, the spectra are invalid; if a threshold is used, it's an unstated free parameter that could dominate. 2. No validation of synthetic failing tests. A coverage row with no concrete input cannot be executed. The paper should either restrict claims to 'synthetic spectra' (and compare against cloning/resampling baselines fairly) or run the generated tests on the faulty program and report that they actually fail. 3. No significance tests or variance across seeds. Some improvements over the best baseline are tiny (e.g., Top-3 Dstar 74 vs 74; Top-5 98 vs 99), yet the text says 'consistently outperforms.' 4. The abstract's 383.83% figure is an average of per-method improvements dominated by the DLFL baselines, which start near zero; a reader should compute the actual Top-K counts (Tables 3–4) before believing the headline.

None of these are fatal to the underlying idea; they are fixes that a serious revision can make. But the paper as submitted does not support 'significantly improves FL effectiveness' for any specific method.

Recommendation: send to peer review. The novelty is real within the subfield, the evaluation scope is right, and the flaw is identifiable and fixable. The reviewers should demand the binarization rule, a validity check on synthetic tests, and honest aggregate reporting.

Referee Report

4 major / 8 minor

Summary. The paper proposes PCD-DAug, a data augmentation approach for fault localization that combines dynamic program slicing with a revised PCA to form a 'principal context', and then trains a conditional diffusion model to generate synthetic failing test cases. The augmented, class-balanced dataset is fed to six FL methods (Dstar, Ochiai, Barinel, MLP-FL, CNN-FL, RNN-FL) and compared against six baselines on 262 Defects4J versions. The paper reports large average improvements in Top-1, Top-3, Top-5, MFR, and MAR metrics, but the central pipeline from continuous diffusion outputs to binary coverage vectors, and the validity of the generated failing test cases, is not demonstrated.

Significance. If the reported effects are genuine, incorporating semantic and statistical contexts into a diffusion-based generator would be a useful contribution to FL under class imbalance. The paper's strengths include a large-scale Defects4J evaluation, comparison with several augmentation baselines, and a stated open-source replication package. However, the central empirical claim is currently not supported because the synthetic samples are not validated as failing executions and the conversion of continuous generated data into binary coverage vectors is unspecified. These issues are load-bearing rather than cosmetic, so the paper needs substantial revision before the results can be trusted.

major comments (4)

[§3.4, Table 2] The paper never specifies how the continuous output of the reverse diffusion process is converted into the binary statement-coverage vectors consumed by Dstar, Ochiai, Barinel, MLP-FL, CNN-FL, and RNN-FL. Algorithm 2 returns X_fusion by selecting existing binary columns from X, but the generated rows are not described as being thresholded, rounded, or otherwise binarized, and no such rule appears in §3.4 or in Table 2. If raw float values are passed to the FL methods, the spectra are invalid; if a threshold is applied silently, the threshold choice is an unstated parameter that can dominate the augmentation effect.
[§3.4 and §4.3] The generated 'failing test cases' are never executed on the faulty program, and no oracle check is reported. Because a generated row carries no concrete test input, the label 'failing' is assigned by construction. The reported Top-K, MFR, and MAR improvements in Tables 3–6 therefore do not establish that the augmentation adds genuine failure-inducing executions; they may reflect plausible-looking but semantically meaningless rows.
[§3.4 and §4.3] The diffusion model is trained on the same failing test cases that are later combined with synthetic rows and used to compute FL effectiveness. This gives the evaluation a self-referential character: the generator can only recombine information already present in the benchmark. The paper should assess whether the gains persist when the original failing test cases are held out from the augmented set, or when synthetic rows are validated by execution.
[Tables 3–6 and RQ1–RQ4] The reported average improvements (e.g., 383.83%, 227.08%, and 224.19%) are presented without any statistical significance tests or variance estimates. Since the diffusion model is stochastic and the augmentation procedure depends on random sampling, the paper should report standard deviations or confidence intervals across repeated runs and, where appropriate, significance tests against the baselines.

minor comments (8)

[Abstract and §1] The text uses 'principle contexts' where 'principal contexts' is meant, and 'metris' instead of 'metrics'.
[Table 3] Several cells in Table 3 have numbers run together (e.g., '3 317 8 79 910 10' and '3 31 7 8 7 9 9 10 11'), making the table difficult to read.
[§4.3 RQ1] The program name 'Mokito' should be 'Mockito'; the same typo appears in Tables 3–5.
[§4.3 RQ4 summary] The summary says 'three data augmentation methods' although four are compared (Aeneas, Lamont, CGAN4FL, and PRAM).
[§3.3] Equation (9) describes classifier-based guidance, but the paper later states that classifier-free guidance is used; clarify whether the classifier-based strategy is implemented or is only discussed as an alternative.
[Algorithm 2] The condition 'if StmFusion matches the dimensional requirements of PCD-DAug or DLFL' is vague and should refer to a specific dimension or parameter.
[Figures 4–8] The captions state 'RImp' but the figures plot ratios rather than a clearly defined relative improvement; please define the exact calculation of RImp in the text.
[References] The reference for Mark Weiser's 'Program slicing' lists the year 2009, but the original paper was published in 1984.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: PCD-DAug is an empirical augmentation pipeline, and the unvalidated synthetic-row assumption is a validity threat rather than a self-referential derivation.

full rationale

The paper does not claim a first-principles derivation; it proposes a generative data-augmentation pipeline and evaluates it empirically on Defects4J coverage data. The load-bearing components (dynamic program slicing, revised PCA, context fusion, classifier-free diffusion guidance, DPM-Solver) are standard external techniques with independent sources. The generated samples are fitted to the original failing and passing coverage rows, and the FL metrics are computed on the augmented dataset, so the evaluation is in-sample; however, the FL rankings are produced by six independent methods (Dstar, Ochiai, Barinel, MLP-FL, CNN-FL, RNN-FL) and could in principle worsen, so the reported improvement is not equal by construction to the generator output. No uniqueness theorem or central premise is imported solely from self-citations; the self-citations in the related-work and baseline sections are not load-bearing. The absence of an oracle check and of an explicit binarization rule for the diffusion model's continuous outputs is a serious validity threat to the claim that the generated rows are genuinely failing test cases, but this is a missing-verification problem, not a circularity in the derivation chain.

Assumptions & free parameters 4 free parameters · 5 assumptions · 1 invented entities

The central claim rests on the assumption that the fused context (slicing plus PCA) is a faithful and sufficient representation of failure-related statements, that the continuous outputs of the diffusion model can be converted to binary coverage without a described procedure, and that synthetic samples can be labeled 'failing' without execution. These are not derived from theory; they are domain assumptions or ad hoc choices introduced in Section 3. The PCA parameters m and K'' and the guidance scale gamma are free parameters whose values are never reported.

free parameters (4)

fusion ratio alpha = 1
Set by hand in Table 2; it determines the initial size K_f = alpha * K' of the fused context in Algorithm 2.
number of largest eigenvalues m in revised PCA = not reported
Algorithm 1 uses m to select eigenvectors; no value is reported for any of the 262 versions.
number of principal components K'' = not reported
Algorithm 1 selects K'' columns for the statistical context; no value is reported.
guidance scale gamma = not reported
Equation (10) defines classifier-free guidance with scale gamma; the paper never states the value used in sampling.

assumptions (5)

domain assumption Coverage matrix and pass/fail vector from Pearson et al. accurately reflect program execution for the 262 Defects4J versions
Used as the input data for all methods in Section 4; any errors in this dataset propagate to all results.
domain assumption Dynamic program slicing identifies the statements that influence the faulty output for a failing test case
The fault semantic context in Section 3.1 is built from dynamic slices; if slices omit faulty statements, the context is incomplete.
ad hoc to paper The revised PCA feature selection retains columns that are useful for generating failing test cases
Algorithm 1 selects columns by summed eigenvector loadings; no justification or ablation shows this selection is beneficial.
domain assumption A continuous-valued diffusion output can be converted into binary coverage vectors without loss of meaning
Diffusion models assume continuous Gaussian noise (Eq. 2), while coverage data is binary; the paper does not specify a thresholding procedure (Section 3.4).
domain assumption Synthesized test cases labeled 'failing' need not be executed to be valid for FL augmentation
The evaluation in Sections 4.3 treats generated samples as failing tests without checking that they fail on the program; this is an unstated assumption.

invented entities (1)

Principal context (fused context matrix X_fusion) independent evidence
purpose: Reduced coverage matrix used as the conditioning input for the diffusion model; it merges statements from dynamic slicing and revised PCA.
Its usefulness is tested indirectly through FL metrics on Defects4J, which provides a falsifiable outcome, but no direct validation of the representation is given.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Principal Context-aware Diffusion Guided Data Augmentation for Fault Localization." pith.science (2026). https://pith.science/paper/73ARIJ6F

@misc{pith2026250524079,
  author       = {Pith},
  title        = {Pith review of: Principal Context-aware Diffusion Guided Data Augmentation for Fault Localization},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/73ARIJ6F}},
  note         = {Machine review of arXiv:2505.24079}
}

read the original abstract

Test cases are indispensable for conducting effective fault localization (FL). However, test cases in practice are severely class imbalanced, i.e. the number of failing test cases (i.e. minority class) is much less than that of passing ones (i.e. majority class). The severe class imbalance between failing and passing test cases have hindered the FL effectiveness. To address this issue, we propose PCD-DAug: a Principal Context-aware Diffusion guided Data Augmentation approach that generate synthesized failing test cases for improving FL. PCD-DAug first combines program slicing with principal component analysis to construct a principal context that shows how a set of statements influences the faulty output via statistical program dependencies. Then, PCD-DAug devises a conditional diffusion model to learn from principle contexts for generating synthesized failing test cases and acquiring a class balanced dataset for FL. We conducted large-scale experiments on six state-of-the-art FL approaches and compare PCD-DAug with six data augmentation baselines. The results show that PCD-DAug significantly improves FL effectiveness, e.g. achieving average improvements of 383.83%, 227.08%, and 224.19% in six FL approaches under the metrics Top-1, Top-3, and Top-5, respectively.

Figures

Figures reproduced from arXiv: 2505.24079 by the authors.

**Figure 2.** Data synthesis stage of PCD-DAug . 3.1 Fault Semantic Context Construction The fault semantic context refers to the subset of statements whose execution leads to failing outputs. We employ dynamic program slicing to construct this fault semantic context, as it relies on specific program inputs, aligning with the generation process of the raw data (i.e., the coverage matrix and error vector) in FL. The raw data is de… view at source ↗

**Figure 3.** An example illustrating PCD-DAug . The final rows of [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗

Figures from the paper (5 more)

**Figure 4.** Figure 4: The RImp of MFR and MAR for PCD-DAug over six original FL methods. [PITH_FULL_IMAGE:figures/full_fig_p011_4.png]

**Figure 5.** Figure 5: The RImp of MFR by PCD-DAug over two data optimization methods. [PITH_FULL_IMAGE:figures/full_fig_p013_5.png]

**Figure 6.** Figure 6: The RImp of MAR by PCD-DAug over two data optimization methods. [PITH_FULL_IMAGE:figures/full_fig_p014_6.png]

**Figure 7.** Figure 7: The RImp of MFR by PCD-DAug over four data augmentation methods. [PITH_FULL_IMAGE:figures/full_fig_p016_7.png]

**Figure 8.** Figure 8: The RImp of MAR by PCD-DAug over four data augmentation methods. [PITH_FULL_IMAGE:figures/full_fig_p016_8.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

48 extracted references · 35 canonical work pages

[1]

Fault localization using visualization of test information

James A Jones. Fault localization using visualization of test information. InProceedings. 26th International Conference on Software Engineering, pages 54–56. IEEE, 2004. 17 Principal Context-aware Diffusion Guided Data Augmentation for Fault Localization

work page 2004
[2]

Empirical evaluation of the tarantula automatic fault-localization technique

James A Jones and Mary Jean Harrold. Empirical evaluation of the tarantula automatic fault-localization technique. InProceedings of the 20th IEEE/ACM international Conference on Automated software engineering, pages 273–282, 2005

2005
[3]

Deepfl: Integrating multiple fault diagnosis dimensions for deep fault localization

Xia Li, Wei Li, Yuqun Zhang, and Lingming Zhang. Deepfl: Integrating multiple fault diagnosis dimensions for deep fault localization. InProceedings of the 28th ACM SIGSOFT international symposium on software testing and analysis, pages 169–180, 2019

work page 2019
[4]

Fault localization with code coverage representation learning

Yi Li, Shaohua Wang, and Tien Nguyen. Fault localization with code coverage representation learning. In2021 IEEE/ACM 43rd International Conference on Software Engineering (ICSE), pages 661–673. IEEE, 2021

work page 2021
[5]

A model for spectra-based software diagnosis.ACM Transactions on software engineering and methodology (TOSEM), 20(3):1–32, 2011

Lee Naish, Hua Jie Lee, and Kotagiri Ramamohanarao. A model for spectra-based software diagnosis.ACM Transactions on software engineering and methodology (TOSEM), 20(3):1–32, 2011

work page 2011
[6]

Fluccs: Using code and change metrics to improve fault localization

Jeongju Sohn and Shin Yoo. Fluccs: Using code and change metrics to improve fault localization. InProceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, pages 273–283, 2017

work page 2017
[7]

Historical spectrum based fault localization.IEEE Transactions on Software Engineering, 47(11):2348–2368, 2019

Ming Wen, Junjie Chen, Yongqiang Tian, Rongxin Wu, Dan Hao, Shi Han, and Shing-Chi Cheung. Historical spectrum based fault localization.IEEE Transactions on Software Engineering, 47(11):2348–2368, 2019

work page 2019
[8]

Software fault localization using dstar (d*)

W Eric Wong, Vidroha Debroy, Yihao Li, and Ruizhi Gao. Software fault localization using dstar (d*). In2012 IEEE Sixth International Conference on Software Security and Reliability, pages 21–30. IEEE, 2012

2012

Show all 48 references

[9]

Cnn-fl: An effective approach for localizing faults using convolutional neural networks

Zhuo Zhang, Yan Lei, Xiaoguang Mao, and Panpan Li. Cnn-fl: An effective approach for localizing faults using convolutional neural networks. In2019 IEEE 26th International Conference on Software Analysis, Evolution and Reengineering (SANER), pages 445–455. IEEE, 2019

2019
[10]

Mitigating the effect of class imbalance in fault localization using context-aware generative adversarial network

Yan Lei, Tiantian Wen, Huan Xie, Lingfeng Fu, Chunyan Liu, Lei Xu, and Hongxia Sun. Mitigating the effect of class imbalance in fault localization using context-aware generative adversarial network. In2023 IEEE/ACM 31st International Conference on Program Comprehension (ICPC),...

2023
[11]

A deep semantics-aware data augmentation method for fault localization.Information and Software Technology, 168:107409, 2024

Jian Hu and Yan Lei. A deep semantics-aware data augmentation method for fault localization.Information and Software Technology, 168:107409, 2024

2024
[12]

A light-weight data augmentation method for fault localization

Jian Hu, Huan Xie, Yan Lei, and Ke Yu. A light-weight data augmentation method for fault localization. Information and Software Technology, 157:107148, 2023

2023
[13]

A universal data augmentation approach for fault localization

Huan Xie, Yan Lei, Meng Yan, Yue Yu, Xin Xia, and Xiaoguang Mao. A universal data augmentation approach for fault localization. InProceedings of the 44th International Conference on Software Engineering, pages 48–60, 2022

2022
[14]

On the accuracy of spectrum-based fault localization

Rui Abreu, Peter Zoeteweij, and Arjan JC Van Gemund. On the accuracy of spectrum-based fault localization. InTesting: Academic and industrial conference practice and research techniques-MUTATION (TAICPART- MUTATION 2007), pages 89–98. IEEE, 2007

2007
[15]

A study of effectiveness of deep learning in locating real faults.Information and Software Technology, 131:106486, 2021

Zhuo Zhang, Yan Lei, Xiaoguang Mao, Meng Yan, Ling Xu, and Xiaohong Zhang. A study of effectiveness of deep learning in locating real faults.Information and Software Technology, 131:106486, 2021

2021
[16]

Fault localization analysis based on deep neural network.Mathematical Problems in Engineering, 2016(1):1820454, 2016

Wei Zheng, Desheng Hu, and Jing Wang. Fault localization analysis based on deep neural network.Mathematical Problems in Engineering, 2016(1):1820454, 2016

2016
[17]

Practitioners’ expectations on automated fault localization

Pavneet Singh Kochhar, Xin Xia, David Lo, and Shanping Li. Practitioners’ expectations on automated fault localization. InProceedings of the 25th international symposium on software testing and analysis, pages 165–176, 2016

2016
[18]

Codeflaws: a programming competition benchmark for evaluating automated program repair tools

Shin Hwei Tan, Jooyong Yi, Sergey Mechtaev, Abhik Roychoudhury, et al. Codeflaws: a programming competition benchmark for evaluating automated program repair tools. In2017 IEEE/ACM 39th International Conference on Software Engineering Companion (ICSE-C), pages 180–182. IEEE, 2017

2017
[19]

Classification of imbalanced data: A review.Interna- tional journal of pattern recognition and artificial intelligence, 23(04):687–719, 2009

Yanmin Sun, Andrew KC Wong, and Mohamed S Kamel. Classification of imbalanced data: A review.Interna- tional journal of pattern recognition and artificial intelligence, 23(04):687–719, 2009

2009
[20]

Learning from imbalanced data.IEEE Transactions on knowledge and data engineering, 21(9):1263–1284, 2009

Haibo He and Edwardo A Garcia. Learning from imbalanced data.IEEE Transactions on knowledge and data engineering, 21(9):1263–1284, 2009

2009
[21]

Effects of class imbalance in test suites: an empirical study of spectrum-based fault localization

Cheng Gong, Zheng Zheng, Wei Li, and Peng Hao. Effects of class imbalance in test suites: an empirical study of spectrum-based fault localization. In2012 IEEE 36th Annual Computer Software and Applications Conference Workshops, pages 470–475. IEEE, 2012

2012
[22]

Program slicing.IEEE Transactions on software engineering, (4):352–357, 2009

Mark Weiser. Program slicing.IEEE Transactions on software engineering, (4):352–357, 2009

2009
[23]

Linear discriminant analysis.Robust data mining, pages 27–33, 2013

Petros Xanthopoulos, Panos M Pardalos, Theodore B Trafalis, Petros Xanthopoulos, Panos M Pardalos, and Theodore B Trafalis. Linear discriminant analysis.Robust data mining, pages 27–33, 2013. 18 Principal Context-aware Diffusion Guided Data Augmentation for Fault Localization

2013
[24]

Principal component analysis.Wiley interdisciplinary reviews: computational statistics, 2(4):433–459, 2010

Hervé Abdi and Lynne J Williams. Principal component analysis.Wiley interdisciplinary reviews: computational statistics, 2(4):433–459, 2010

2010
[25]

mixup: Beyond empirical risk minimization.arXiv preprint arXiv:1710.09412, 2017

Hongyi Zhang, Moustapha Cisse, Yann N Dauphin, and David Lopez-Paz. mixup: Beyond empirical risk minimization.arXiv preprint arXiv:1710.09412, 2017

2017 arXiv
[26]

Generative adversarial networks.Communications of the ACM, 63(11):139–144, 2020

Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. Generative adversarial networks.Communications of the ACM, 63(11):139–144, 2020

2020
[27]

Conditional variational autoencoder with adversarial learning for end-to-end text-to-speech

Jaehyeon Kim, Jungil Kong, and Juhee Son. Conditional variational autoencoder with adversarial learning for end-to-end text-to-speech. InInternational Conference on Machine Learning, pages 5530–5540. PMLR, 2021

2021
[28]

Generative adversarial networks (gans) challenges, solutions, and future directions.ACM Computing Surveys (CSUR), 54(3):1–42, 2021

Divya Saxena and Jiannong Cao. Generative adversarial networks (gans) challenges, solutions, and future directions.ACM Computing Surveys (CSUR), 54(3):1–42, 2021

2021
[29]

Dynamic program slicing.ACM SIGPlan Notices, 25(6):246–256, 1990

Hiralal Agrawal and Joseph R Horgan. Dynamic program slicing.ACM SIGPlan Notices, 25(6):246–256, 1990

1990
[30]

Feature selection using principal component analysis

Fengxi Song, Zhongwei Guo, and Dayong Mei. Feature selection using principal component analysis. In2010 international conference on system science, engineering design and manufacturing informatization, volume 1, pages 27–30. IEEE, 2010

2010
[31]

Classifier-free diffusion guidance.arXiv preprint arXiv:2207.12598, 2022

Jonathan Ho and Tim Salimans. Classifier-free diffusion guidance.arXiv preprint arXiv:2207.12598, 2022

2022 arXiv
[32]

Denoising diffusion probabilistic models.Advances in neural information processing systems, 33:6840–6851, 2020

Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising diffusion probabilistic models.Advances in neural information processing systems, 33:6840–6851, 2020

2020
[33]

Auto-encoding variational bayes, 2013

Diederik P Kingma, Max Welling, et al. Auto-encoding variational bayes, 2013

2013
[34]

U-net: Convolutional networks for biomedical image segmentation

Olaf Ronneberger, Philipp Fischer, and Thomas Brox. U-net: Convolutional networks for biomedical image segmentation. InMedical image computing and computer-assisted intervention–MICCAI 2015: 18th international conference, Munich, Germany, October 5-9, 2015, proceedings, part I...

2015
[35]

Attention is all you need.Advances in neural information processing systems, 30, 2017

Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. Attention is all you need.Advances in neural information processing systems, 30, 2017

2017
[36]

Effective statistical fault localization using program slices

Yan Lei, Xiaoguang Mao, Ziying Dai, and Chengsong Wang. Effective statistical fault localization using program slices. In2012 IEEE 36th Annual Computer Software and Applications Conference, pages 1–10. IEEE, 2012

2012
[37]

A brief survey of program slicing.ACM SIGSOFT Software Engineering Notes, 30(2):1–36, 2005

Baowen Xu, Ju Qian, Xiaofang Zhang, Zhongqiang Wu, and Lin Chen. A brief survey of program slicing.ACM SIGSOFT Software Engineering Notes, 30(2):1–36, 2005

2005
[38]

Diffusion models beat gans on image synthesis.Advances in neural information processing systems, 34:8780–8794, 2021

Prafulla Dhariwal and Alexander Nichol. Diffusion models beat gans on image synthesis.Advances in neural information processing systems, 34:8780–8794, 2021

2021
[39]

Dpm-solver: A fast ode solver for diffusion probabilistic model sampling in around 10 steps.Advances in Neural Information Processing Systems, 35:5775–5787, 2022

Cheng Lu, Yuhao Zhou, Fan Bao, Jianfei Chen, Chongxuan Li, and Jun Zhu. Dpm-solver: A fast ode solver for diffusion probabilistic model sampling in around 10 steps.Advances in Neural Information Processing Systems, 35:5775–5787, 2022

2022
[40]

A theoretical analysis of the risk evaluation formulas for spectrum-based fault localization.ACM Transactions on software engineering and methodology (TOSEM), 22(4):1–40, 2013

Xiaoyuan Xie, Tsong Yueh Chen, Fei-Ching Kuo, and Baowen Xu. A theoretical analysis of the risk evaluation formulas for spectrum-based fault localization.ACM Transactions on software engineering and methodology (TOSEM), 22(4):1–40, 2013

2013
[41]

Defects4j: A database of existing faults to enable controlled testing studies for java programs

René Just, Darioush Jalali, and Michael D Ernst. Defects4j: A database of existing faults to enable controlled testing studies for java programs. InProceedings of the 2014 international symposium on software testing and analysis, pages 437–440, 2014

2014
[42]

Evaluating & improving fault localization techniques.University of Washington Department of Computer Science and Engineering, Seattle, WA, USA, Tech

Spencer Pearson, José Campos, René Just, Gordon Fraser, Rui Abreu, Michael D Ernst, Deric Pang, and Benjamin Keller. Evaluating & improving fault localization techniques.University of Washington Department of Computer Science and Engineering, Seattle, WA, USA, Tech. Rep. UW-CS...

2016
[43]

An evaluation of similarity coefficients for software fault localization

Rui Abreu, Peter Zoeteweij, and Arjan JC Van Gemund. An evaluation of similarity coefficients for software fault localization. In2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC’06), pages 39–46. IEEE, 2006

2006
[44]

Spectrum-based multiple fault localization

Rui Abreu, Peter Zoeteweij, and Arjan JC Van Gemund. Spectrum-based multiple fault localization. In2009 IEEE/ACM International Conference on Automated Software Engineering, pages 88–99. IEEE, 2009

2009
[45]

Ietcr: An information entropy based test case reduction strategy for mutation-based fault localization.IEEE Access, 8:124297–124310, 2020

Haifeng Wang, Bin Du, Jie He, Yong Liu, and Xiang Chen. Ietcr: An information entropy based test case reduction strategy for mutation-based fault localization.IEEE Access, 8:124297–124310, 2020

2020
[46]

A theoretical study: The impact of cloning failed test cases on the effectiveness of fault localization

Yichao Gao, Zhenyu Zhang, Long Zhang, Cheng Gong, and Zheng Zheng. A theoretical study: The impact of cloning failed test cases on the effectiveness of fault localization. In2013 13th International Conference on Quality Software, pages 288–291. IEEE, 2013. 19 Principal Context...

2013
[47]

A theoretical analysis on cloning the failed test cases to improve spectrum-based fault localization.Journal of Systems and Software, 129:35–57, 2017

Long Zhang, Lanfei Yan, Zhenyu Zhang, Jian Zhang, WK Chan, and Zheng Zheng. A theoretical analysis on cloning the failed test cases to improve spectrum-based fault localization.Journal of Systems and Software, 129:35–57, 2017

2017
[48]

Improving deep-learning-based fault localization with resampling.Journal of Software: Evolution and Process, 33(3):e2312, 2021

Zhuo Zhang, Yan Lei, Xiaoguang Mao, Meng Yan, Ling Xu, and Junhao Wen. Improving deep-learning-based fault localization with resampling.Journal of Software: Evolution and Process, 33(3):e2312, 2021. 20

2021

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.

[1] [1]

Fault localization using visualization of test information

James A Jones. Fault localization using visualization of test information. InProceedings. 26th International Conference on Software Engineering, pages 54–56. IEEE, 2004. 17 Principal Context-aware Diffusion Guided Data Augmentation for Fault Localization

work page 2004

[2] [2]

Empirical evaluation of the tarantula automatic fault-localization technique

James A Jones and Mary Jean Harrold. Empirical evaluation of the tarantula automatic fault-localization technique. InProceedings of the 20th IEEE/ACM international Conference on Automated software engineering, pages 273–282, 2005

2005

[3] [3]

Deepfl: Integrating multiple fault diagnosis dimensions for deep fault localization

Xia Li, Wei Li, Yuqun Zhang, and Lingming Zhang. Deepfl: Integrating multiple fault diagnosis dimensions for deep fault localization. InProceedings of the 28th ACM SIGSOFT international symposium on software testing and analysis, pages 169–180, 2019

work page 2019

[4] [4]

Fault localization with code coverage representation learning

Yi Li, Shaohua Wang, and Tien Nguyen. Fault localization with code coverage representation learning. In2021 IEEE/ACM 43rd International Conference on Software Engineering (ICSE), pages 661–673. IEEE, 2021

work page 2021

[5] [5]

A model for spectra-based software diagnosis.ACM Transactions on software engineering and methodology (TOSEM), 20(3):1–32, 2011

Lee Naish, Hua Jie Lee, and Kotagiri Ramamohanarao. A model for spectra-based software diagnosis.ACM Transactions on software engineering and methodology (TOSEM), 20(3):1–32, 2011

work page 2011

[6] [6]

Fluccs: Using code and change metrics to improve fault localization

Jeongju Sohn and Shin Yoo. Fluccs: Using code and change metrics to improve fault localization. InProceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, pages 273–283, 2017

work page 2017

[7] [7]

Historical spectrum based fault localization.IEEE Transactions on Software Engineering, 47(11):2348–2368, 2019

Ming Wen, Junjie Chen, Yongqiang Tian, Rongxin Wu, Dan Hao, Shi Han, and Shing-Chi Cheung. Historical spectrum based fault localization.IEEE Transactions on Software Engineering, 47(11):2348–2368, 2019

work page 2019

[8] [8]

Software fault localization using dstar (d*)

W Eric Wong, Vidroha Debroy, Yihao Li, and Ruizhi Gao. Software fault localization using dstar (d*). In2012 IEEE Sixth International Conference on Software Security and Reliability, pages 21–30. IEEE, 2012

2012