Metraipolis › archive › dc_d38cb44bbd6b

Conflict Extraction in Probabilistic Datalog Analyses — arXiv:2608.10755

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.10755
License (as archived)
CC0-1.0
Archived
2026-10-19T06:22:14.855Z
SHA-256 of the archived text
964fb11b64c0999cae8df8c668e2faa4d5da76c37fdb2c150bc2cd978cdec5a4
Stable URL of this page
https://metraipolis.com/documento/dc_d38cb44bbd6b

How to cite

Conflict Extraction in Probabilistic Datalog Analyses — arXiv:2608.10755 — arXiv (en), https://arxiv.org/abs/2608.10755 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d38cb44bbd6b (Metraipolis archive dc_d38cb44bbd6b, sha256 964fb11b64c0999cae8df8c668e2faa4d5da76c37fdb2c150bc2cd978cdec5a4)
BibTeX
@misc{dcd38cb44bbd6b,
  title = {Conflict Extraction in Probabilistic Datalog Analyses — arXiv:2608.10755},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.10755},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d38cb44bbd6b; sha256 964fb11b64c0999cae8df8c668e2faa4d5da76c37fdb2c150bc2cd978cdec5a4},
  year = {2026}
}

Archived text

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

Probabilistic extensions of Datalog enable static analyses such as pointer analysis, data race detection, and side-channel analysis to rank alarms by likelihood, but this added expressiveness also introduces a new challenge absent from deterministic analyses: the final output may contain alarms that are individually plausible yet mutually inconsistent, because marginal probabilities do not guarantee joint satisfiability. As a result, developers may spend effort investigating combinations of alarms that can never co-occur in any possible world. We address this problem by formalizing such inconsistencies as minimal unsatisfiable subsets (MUSes) and introducing PPProbe, a conflict extractor specialized for probabilistic Datalog analyses. Rather than improving MUS enumeration in general, PPProbe exploits the structure of Datalog derivation graphs to guide the search toward likely conflicts and prune the search space through bottom-up UNSAT inference. We evaluate PPProbe on 70 benchmarks from power side-channel analysis, data race detection, semantic diffing, and Bayesian-network inference. The results show that PPProbe achieves 2.5 to 24 times higher throughput than state-of-the-art MUS enumerators, and that the conflicts it identifies yield a conservative estimate of false-positive reduction, filtering out an average of 47.7% of mutually inconsistent alarms.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-12 in cs.SE).
Categorie arXiv: Software Engineering (cs.SE) ; Programming Languages (cs.PL).
Pagina del lavoro: https://arxiv.org/abs/2608.10755 — 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-19T06:14:48.479Z dalla pagina https://arxiv.org/catchup/cs.SE/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).