Metraipolis › archive › dc_8919359cc295
TRACE: Traversal and Reasoning Algebraic Computing Engine for Formal Hardware Verification — arXiv:2608.16458
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.16458
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T19:02:30.780Z
- SHA-256 of the archived text
d9c57f0af932fa022f7295a5ed521678d0037eea8a4e85578d0df078a1473a02- Stable URL of this page
https://metraipolis.com/documento/dc_8919359cc295
How to cite
TRACE: Traversal and Reasoning Algebraic Computing Engine for Formal Hardware Verification — arXiv:2608.16458 — arXiv (en), https://arxiv.org/abs/2608.16458 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8919359cc295 (Metraipolis archive dc_8919359cc295, sha256 d9c57f0af932fa022f7295a5ed521678d0037eea8a4e85578d0df078a1473a02)
BibTeX
@misc{dc8919359cc295,
title = {TRACE: Traversal and Reasoning Algebraic Computing Engine for Formal Hardware Verification — arXiv:2608.16458},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.16458},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8919359cc295; sha256 d9c57f0af932fa022f7295a5ed521678d0037eea8a4e85578d0df078a1473a02},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.16458. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Modern hardware verification of complex circuits relies heavily on the efficiency of formal methods. For complex arithmetic circuits in particular Symbolic Computer Algebra (SCA) engines which represent pseudo-boolean functions using polynomials are crucial. As circuit complexity grows in the age of AI, verification of arithmetic primitives, including Multiplication, Addition, Multiply-Accumulate (MAC), becomes a computational bottleneck. To address this, we introduce TRACE (Traversal and Reasoning Algebraic Computing Engine), a highly efficient framework designed to investigate the intersection of traversal strategies and proof efficiency. Unlike existing SCA tools which are mainly limited to multipliers, TRACE offers a flexible framework for researchers to analyze memory usage and verification time across a wide range of arithmetic circuits (adder, multiplier and MAC). To overcome the state-explosion problem inherent in polynomial expansion, the engine incorporates advanced reduction techniques, including optimized traversal strategies, conflict removal, and polarity-based optimization for compact symbolic representations. Our experimental results show that for optimized MAC, for the first time, TRACE was able to verify previously unverifiable circuits Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-18 in cs.AR). Categorie arXiv: Hardware Architecture (cs.AR). Pagina del lavoro: https://arxiv.org/abs/2608.16458 — 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-18T18:07:33.282Z dalla pagina https://arxiv.org/catchup/cs.AR/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).