Metraipolis › archive › dc_77632f455d34
Bit-Precise CHC Satisfiability Using Theory-Modular Reasoning — arXiv:2608.05337
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.05337
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T10:50:24.355Z
- SHA-256 of the archived text
46c8274c259f8636572244eaec8cbde2a29599bb8f68e21c2e372f46bebcedd8- Stable URL of this page
https://metraipolis.com/documento/dc_77632f455d34
How to cite
Bit-Precise CHC Satisfiability Using Theory-Modular Reasoning — arXiv:2608.05337 — arXiv (en), https://arxiv.org/abs/2608.05337 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_77632f455d34 (Metraipolis archive dc_77632f455d34, sha256 46c8274c259f8636572244eaec8cbde2a29599bb8f68e21c2e372f46bebcedd8)
BibTeX
@misc{dc77632f455d34,
title = {Bit-Precise CHC Satisfiability Using Theory-Modular Reasoning — arXiv:2608.05337},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.05337},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_77632f455d34; sha256 46c8274c259f8636572244eaec8cbde2a29599bb8f68e21c2e372f46bebcedd8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.05337. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Deciding satisfiability of Constrained Horn Clauses (CHCs) modulo the theory of fixed-size bit-vectors ($\mathcal{T}_B$) is fundamental to bit-precise program verification. However, state-of-the-art CHC-solvers often struggle with $\mathcal{T}_B$, limiting scalability in bit-precise reasoning. We present Mosaic, a theory-modular framework for deciding satisfiability of CHCs modulo $\mathcal{T}_B$ by combining reasoning in $\mathcal{T}_B$ and the theory of Integer Arithmetic ($\mathcal{T}_I$). Given a CHC set modulo $\mathcal{T}_B$, Mosaic partitions it into two fragments interpreted over $\mathcal{T}_B$ and $\mathcal{T}_I$. Moreover, it implements an algorithm that reasons about the fragments in a modular fashion, exchanges information between them via sound translations across theories, and determines satisfiability w.r.t. the original CHC set. We implemented a prototype of Mosaic using Z3 and Spacer and evaluated it on bit-manipulating benchmarks. Our evaluation shows that Mosaic significantly outperforms Spacer on these benchmarks.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-07 in cs.LO).
Categorie arXiv: Logic in Computer Science (cs.LO) ; Programming Languages (cs.PL).
Pagina del lavoro: https://arxiv.org/abs/2608.05337 — 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-31T10:38:07.095Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).