FastPoly: An Efficient Polynomial Package for the Verification of Integer Arithmetic Circuits

Konrad, Alexander; Scholl, Christoph

doi:10.34727/2025/isbn.978-3-85448-084-6_20

Record link:

http://hdl.handle.net/20.500.12708/219550
https://doi.org/10.34727/2025/isbn.978-3-85448-084-6_20

Title:

FastPoly: An Efficient Polynomial Package for the Verification of Integer Arithmetic Circuits

Citation:

Konrad, A., & Scholl, C. (2025). FastPoly: An Efficient Polynomial Package for the Verification of Integer Arithmetic Circuits. In A. Irfan & D. Kaufmann (Eds.), Proceedings of the 25th Conference on Formal Methods in Computer-Aided Design – FMCAD 2025 (pp. 139–144). TU Wien Academic Press. https://doi.org/10.34727/2025/isbn.978-3-85448-084-6_20

reposiTUm DOI:

10.34727/2025/isbn.978-3-85448-084-6_20

CatalogPlus:

AC17653243

Publication Type:

Inproceedings - Full-Paper Contribution

Language:

English

Authors:

Konrad, Alexander
Scholl, Christoph

Editors:

Irfan, Ahmed
Kaufmann, Daniela