Chen, C., Kaufmann, D., Deng, C., Song, Z., Zhang, H., & Yu, C. (2026). ReVEAL: GNN-Guided Reverse Engineering for Formal Verification of Optimized Multipliers. In S. Junges & G. Katz (Eds.), Tools and Algorithms for the Construction and Analysis of Systems : 32nd International Conference, TACAS 2026, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2026, Turin, Italy, April 11–16, 2026, Proceedings, Part II (pp. 309–333). Springer. https://doi.org/10.1007/978-3-032-22749-2_16 ( reposiTUm)

Kaufmann, D., & Hofstadler, C. (2025). Recycling Algebraic Proof Certificates. In M. Erașcu & M. Janota (Eds.), Proceedings of the 10th International Workshop on Satisfiability Checking and Symbolic Computation (SC-Square 2025) Collocated with The 30th International Conference on Automated Deduction (CADE 2025) (pp. 35–40). Ceur. ( reposiTUm)

Kaufmann, D., & Berthomieu, J. (2025). Extracting Linear Relations from Gröbner Bases for Formal Verification of And-Inverter Graphs. In A. Gurfinkel & M. Heule (Eds.), Tools and Algorithms for the Construction and Analysis of Systems : 31st International Conference, TACAS 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Hamilton, ON, Canada, May 3–8, 2025, Proceedings, Part I (pp. 355–374). Springer. https://doi.org/10.1007/978-3-031-90643-5_19 ( reposiTUm)

Rath, J., Eisenhofer, C., Kaufmann, D., Bjørner, N., & Kovacs, L. (2025). PolySAT: Word-level Bit-vector Reasoning in Z3. In J. Protzenko & A. Raad (Eds.), Verified Software. Theories, Tools and Experiments : 16th International Conference, VSTTE 2024, Prague, Czech Republic, October 14–15, 2024, Revised Selected Papers (pp. 47–69). Springer. https://doi.org/10.1007/978-3-031-86695-1_4 ( reposiTUm)

Hofstadler, C., & Kaufmann, D. (2025). Guess and Prove: A Hybrid Approach to Linear Polynomial Recovery in Circuit Verification. In M. Garcia de la Banda (Ed.), 31st International Conference on Principles and Practice of Constraint Programming (CP 2025). Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.CP.2025.14 ( reposiTUm)

Hader, T., Kaufmann, D., Irfan, A., Graham-Lengrand, S., & Kovács, L. (2024). MCSat-Based Finite Field Reasoning in the Yices2 SMT Solver (Short Paper). In Automated Reasoning: 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3–6, 2024, Proceedings, Part I (pp. 386–395). Springer International Publishing. https://doi.org/10.1007/978-3-031-63498-7_23 ( reposiTUm)

Kaufmann, D. (2025, September 24). Verifying Arithmetic Circuits with Polynomials [Conference Presentation]. SYNASC 2025: 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania. ( reposiTUm)