Metraipolis › archive › dc_7ef036ed996d

BISCEPTER: Probability-Driven Bisection for Large-Scale System Software — arXiv:2610.02995

Source
arXiv
Original
https://arxiv.org/abs/2610.02995
License (as archived)
CC0-1.0
Archived
2026-10-05T23:11:34.746Z
SHA-256 of the archived text
26e3c7d309f32c686666d1d87d7922c5bc796d6efa7444c19e1d5a0c9fce9ca8
Stable URL of this page
https://metraipolis.com/documento/dc_7ef036ed996d

How to cite

BISCEPTER: Probability-Driven Bisection for Large-Scale System Software — arXiv:2610.02995 — arXiv, https://arxiv.org/abs/2610.02995 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7ef036ed996d (Metraipolis archive dc_7ef036ed996d, sha256 26e3c7d309f32c686666d1d87d7922c5bc796d6efa7444c19e1d5a0c9fce9ca8)
BibTeX
@misc{dc7ef036ed996d,
  title = {BISCEPTER: Probability-Driven Bisection for Large-Scale System Software — arXiv:2610.02995},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.02995},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7ef036ed996d; sha256 26e3c7d309f32c686666d1d87d7922c5bc796d6efa7444c19e1d5a0c9fce9ca8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.02995. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Identifying the bug-inducing commit (BIC) is a fundamental step in regression debugging and a key input to emerging BIC-aware fault-localization pipelines. In practice, BICs are commonly obtained with bisection. Standard bisection selects the median commit of the remaining good-bad interval, thereby balancing commit count. This strategy is optimal under the assumption that each commit is equally likely to be the BIC. This paper shows that this assumption does not match real-world BIC histories. We construct a dataset of 8,172 bug reports from GCC, the Linux kernel, and MariaDB. We find a strong temporal skew: across the studied systems, 50% of BICs lie within the most recent 0.69% of the report-time commit history. Motivated by this observation, we introduce BISCEPTER, a probability-driven bisection approach that uses historical BIC latency as a lightweight prior. Instead of selecting pivots that split the number of remaining commits, BISCEPTER selects weighted-median pivots that split estimated BIC probability mass, while preserving the same good-bad oracle and interface as standard bisection. We evaluate BISCEPTER on three large-scale systems. The evaluation results show that BISCEPTER reduces bisection iterations by 25.75% on average (up to 55.55%) compared with standard median bisection, while improving over the baseline in 91.26% of test cases. Robustness experiments further demonstrate that the benefit remains stable under noisy historical data. We expect that our research can effectively save effort in debugging software in practice and, more broadly, benefit future software engineering research by bringing insights about BIC distribution.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.SE, nuovi lavori del giorno).
Categorie arXiv: Software Engineering (cs.SE).
Pagina del lavoro: https://arxiv.org/abs/2610.02995 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-05T23:01:53.628Z dalla pagina https://arxiv.org/list/cs.SE/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).