Column-wise verification of multipliers using computer algebra. - Daniela Ritirc; Armin Biere; Manuel Kauers (FMCAD, 2017)

Challenges in Verifying Arithmetic Circuits Using Computer Algebra. - Armin Biere; Manuel Kauers; Daniela Ritirc (SYNASC, 2017)

Improving and extending the algebraic approach for verifying gate-level multipliers. - Daniela Ritirc; Armin Biere; Manuel Kauers (DATE, 2018)

A Practical Polynomial Calculus for Arithmetic Circuit Verification. - Daniela Ritirc; Armin Biere; Manuel Kauers (SC-Square@FLOC, 2018)

Verifying Large Multipliers by Combining SAT and Computer Algebra. - Daniela Kaufmann; Armin Biere; Manuel Kauers (FMCAD, 2019)

SAT, Computer Algebra, Multipliers. - Daniela Ritirc; Armin Biere; Manuel Kauers (Vampire, 2019)

Nullstellensatz-Proofs for Multiplier Verification. - Daniela Kaufmann; Armin Biere (CASC, 2020)

From DRUP to PAC and Back. - Daniela Kaufmann; Armin Biere; Manuel Kauers (DATE, 2020)

The Proof Checkers Pacheck and Pastèque for the Practical Algebraic Calculus. - Daniela Kaufmann; Mathias Fleury; Armin Biere (FMCAD, 2020)

Practical Algebraic Calculus Checker. - Mathias Fleury; Daniela Kaufmann (Arch. Formal Proofs, 2020)

Incremental column-wise verification of arithmetic circuits using computer algebra. - Daniela Kaufmann; Armin Biere; Manuel Kauers (Formal Methods Syst. Des., 2020)

Formale Verifikation von Multiplizierern mit Computeralgebra. - Daniela Kaufmann (Ausgezeichnete Informatikdissertationen, 2020)

AMulet 2.0 for Verifying Multiplier Circuits. - Daniela Kaufmann; Armin Biere (TACAS (2), 2021)

Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification. - Daniela Kaufmann; Paul Beame; Armin Biere; Jakob Nordström (DATE, 2022)

Fuzzing-Based Grammar Inference. - Hannes Sochor; Flavio Ferrarotti; Daniela Kaufmann (MEDI, 2022)

Fuzzing and Delta Debugging And-Inverter Graph Verification Tools. - Daniela Kaufmann; Armin Biere (TAP@STAF, 2022)

SMT Solving over Finite Field Arithmetic. - Thomas Hader; Daniela Kaufmann; Laura Kovács (LPAR, 2023)

Improving AMulet2 for verifying multiplier circuits using SAT solving and computer algebra. - Daniela Kaufmann; Armin Biere (Int. J. Softw. Tools Technol. Transf., 2023)

MCSat-Based Finite Field Reasoning in the Yices2 SMT Solver (Short Paper). - Thomas Hader; Daniela Kaufmann; Ahmed Irfan; Stéphane Graham-Lengrand; Laura Kovács (IJCAR (1), 2024)

PolySAT: Word-level Bit-vector Reasoning in Z3. - Jakob Rath; Clemens Eisenhofer; Daniela Kaufmann; Nikolaj S. Bjørner; Laura Kovács (VSTTE, 2024)

Life span of SAT techniques. - Mathias Fleury; Daniela Kaufmann (CoRR, 2024)

MCSat-based Finite Field Reasoning in the Yices2 SMT Solver. - Thomas Hader; Daniela Kaufmann; Ahmed Irfan; Stéphane Graham-Lengrand; Laura Kovács (CoRR, 2024)

Fuzzing-based grammar learning from a minimal set of seed inputs. - Hannes Sochor; Flavio Ferrarotti; Daniela Kaufmann (J. Comput. Lang., 2024)

Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker. - Daniela Kaufmann; Mathias Fleury; Armin Biere; Manuel Kauers (Formal Methods Syst. Des., 2024)

Guess and Prove: A Hybrid Approach to Linear Polynomial Recovery in Circuit Verification. - Clemens Hofstadler; Daniela Kaufmann (CP, 2025)

Extracting Linear Relations from Gröbner Bases for Formal Verification of And-Inverter Graphs. - Daniela Kaufmann; Jérémy Berthomieu (TACAS (1), 2025)

Recycling Algebraic Proof Certificates. - Daniela Kaufmann; Clemens Hofstadler (CoRR, 2025)