Metraipolis › archive › dc_525b40bfc3da

Efficient Program Reduction for Library Fuzzing Harnesses — arXiv:2610.23054

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.23054
License (as archived)
CC0-1.0
Archived
2026-10-19T09:37:10.473Z
SHA-256 of the archived text
69b08d89984fb9e03fefb763b588a4d32c380c4363ad4b640d7c68258e948641
Stable URL of this page
https://metraipolis.com/documento/dc_525b40bfc3da

How to cite

Efficient Program Reduction for Library Fuzzing Harnesses — arXiv:2610.23054 — arXiv (en), https://arxiv.org/abs/2610.23054 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_525b40bfc3da (Metraipolis archive dc_525b40bfc3da, sha256 69b08d89984fb9e03fefb763b588a4d32c380c4363ad4b640d7c68258e948641)
BibTeX
@misc{dc525b40bfc3da,
  title = {Efficient Program Reduction for Library Fuzzing Harnesses — arXiv:2610.23054},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.23054},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_525b40bfc3da; sha256 69b08d89984fb9e03fefb763b588a4d32c380c4363ad4b640d7c68258e948641},
  year = {2026}
}

Archived text

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

Library fuzzing harnesses translate generated inputs into API calls. When a complex harness triggers a crash, developers must determine whether the cause is a library defect or invalid harness usage. A smaller reproducer can simplify this investigation, but obtaining one requires repeatedly building and executing modified harnesses and analyzing their crashes, making manual or even automatic minimization time-consuming. Moreover, data-dependent statements prevent the reducer to remove unnecessary code and the heavy stack trace symbolization in libraries also slows down the candidate execution. To address these challenges, we present HarnessMinimizer, a system for efficient minimization of C/C++ library fuzzing harnesses. Its optimized pipeline reuses header analysis and prepared libraries and runtimes to reduce the work required to build and execute each simplified harness during the reduction process. It records and replays input values so that unnecessary input operations can be removed without changing the values supplied to surviving calls. It also uses a fast method to check whether each simplified harness preserves the original crash, avoiding repeated stack trace symbolization. We evaluate HarnessMinimizer with four reduction engines on 200 crash cases from 21 open source libraries. Compared with the unoptimized pipeline, HarnessMinimizer achieves speedups of 3.46-4.51 times in average total wall time. Average harness size decreases from 1,352 original tokens to 143-263 remaining tokens after minimization. In crash triage using a large language model, accuracy in identifying harness bugs increases from 28% with the original harnesses to 44-51% with the minimized harnesses, while accuracy for library bugs remains at 100%.

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.23054 — 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-19T09:31:59.702Z dalla pagina https://arxiv.org/list/cs.SE/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).