TU Wien Informatics

Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Daniela Kaufmann

Projektass.in(FWF) Dipl.-Ing.in Dr.in techn.

Daniela Kaufmann

Role

Contact

2025W

 

  • Verifying Arithmetic Circuits with Polynomials / 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.
    Project: CalgSAT (2024–2027)
  • Guess and Prove: A Hybrid Approach to Linear Polynomial Recovery in Circuit Verification / 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
    Project: CalgSAT (2024–2027)
  • PolySAT: Word-level Bit-vector Reasoning in Z3 / 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
    Projects: ARTIST (2021–2026) / CalgSAT (2024–2027) / QuAT (2024–2025) / SFB SPyCoDe (2023–2030)
  • Extracting Linear Relations from Gröbner Bases for Formal Verification of And-Inverter Graphs / 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
    Project: CalgSAT (2024–2027)
  • Recycling Algebraic Proof Certificates / 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.
    Project: CalgSAT (2024–2027)
  • Proceedings of the 25th Conference on Formal Methods in Computer-Aided Design – FMCAD 2025 / Irfan, A., & Kaufmann, D. (Eds.). (2025). Proceedings of the 25th Conference on Formal Methods in Computer-Aided Design – FMCAD 2025 (Vol. 6). TU Wien Academic Press. https://doi.org/10.34727/2025/isbn.978-3-85448-084-6
    Downloads: PDF (9.69 MB) / PDF (421 KB)
  • PolySAT: Word-level Bit-vector Reasoning in Z3 / Rath, J., Eisenhofer, C., Kaufmann, D., Bjørner, N., & Kovacs, L. (2024, October 14). PolySAT: Word-level Bit-vector Reasoning in Z3 [Conference Presentation]. VSTTE 2024, Prague, Czechia. http://hdl.handle.net/20.500.12708/211021
    Projects: ARTIST (2021–2026) / SFB SPyCoDe (2023–2030)
  • MCSat-Based Finite Field Reasoning in the Yices2 SMT Solver (Short Paper) / 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
    Projects: ARTIST (2021–2026) / CalgSAT (2024–2027) / SFB SPyCoDe (2023–2030)
  • Fuzzing-based grammar learning from a minimal set of seed inputs / Sochor, H., Ferrarotti, F., & Kaufmann, D. (2024). Fuzzing-based grammar learning from a minimal set of seed inputs. JOURNAL OF COMPUTER LANGUAGES, 78, Article 101252. https://doi.org/10.1016/j.cola.2023.101252
    Project: ARTIST (2021–2026)
  • SMT Solving over Finite Field Arithmetic / Hader, T., Kaufmann, D., & Kovacs, L. (2023). SMT Solving over Finite Field Arithmetic. In R. Piscac & A. Voronkov (Eds.), Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (pp. 238–256). https://doi.org/10.29007/4n6w
    Project: ARTIST (2021–2026)
  • Improving AMulet2 for verifying multiplier circuits using SAT solving and computer algebra / Kaufmann, D., & Biere, A. (2023). Improving AMulet2 for verifying multiplier circuits using SAT solving and computer algebra. International Journal on Software Tools for Technology Transfer, 25(2), 133–144. https://doi.org/10.1007/s10009-022-00688-6
    Download: PDF (1.23 MB)