Daniela Kaufmann
Projektass.in(FWF) Dipl.-Ing.in Dr.in techn.
Research Focus
- Logic and Computation: 80%
- Artificial Intelligence and Data Science: 10%
- Computer Engineering: 10%
Research Areas
- Computational Logic, verification and validation, computer algebra, Automated Reasoning, Formal Methods
Role
- PostDoc Researcher
Formal Methods in Systems Engineering, E192-04
Contact
- daniela.kaufmann@tuwien.ac.at
- 1040 Wien, Favoritenstrasse 9 / Room HA0310
- vCard from TISS
Courses
Projects
- 2027 – 2031 / European Commission
- 2024 – 2027 / Austrian Science Fund (FWF) / Publications (8)
Publications
- Saccomani, P., Mohamed, A., Pertseva, E., Kaufmann, D., Tinelli, C., Barrett, C., Barbosa, H. (2026). Proof Production for Satisfiability Modulo Finite Fields with Proof Checking in Pacheck and Lean. In B. Dutertre B. Könighofer (Eds.), Proceedings of the 26th Conference on Formal Methods in Computer-Aided Design – FMCAD 2026 (pp. 113–123). TU Wien Academic Press. Peer-reviewed.DOI: 10.34727/2026/isbn.978-3-85448-093-8_17 / Download: PDF
- Hofstadler, C., Kaufmann, D., Chen, C. (2026). Avoiding Big Integers: Parallel Multimodular Algebraic Verification of Arithmetic Circuits. In A. Biere, C. Lutz, S. Negri (Eds.), Automated Reasoning : 13th International Joint Conference, IJCAR 2026, Lisbon, Portugal, July 26–29, 2026, Proceedings, Part I (pp. 175–193). Springer Cham. Peer-reviewed.DOI: 10.1007/978-3-032-32589-1_11 / Project: CalgSAT
- 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. Peer-reviewed.DOI: 10.1007/978-3-032-22749-2_16 / Project: CalgSAT
- 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. Peer-reviewed.DOI: 10.4230/LIPIcs.CP.2025.14 / Project: CalgSAT
- 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. Peer-reviewed.
- 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. Peer-reviewed.DOI: 10.1007/978-3-031-90643-5_19 / Project: CalgSAT
- 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. Peer-reviewed.
- 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-WS.org. Peer-reviewed.HDL: 20.500.12708/222940 / Project: CalgSAT
- 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. Peer-reviewed.
- 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. Peer-reviewed.DOI: 10.1016/j.cola.2023.101252 / Project: ARTIST
- 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). Peer-reviewed.DOI: 10.29007/4n6w / Project: ARTIST
- 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. Peer-reviewed.DOI: 10.1007/s10009-022-00688-6 / Download: PDF
Presentations
- 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. Invited.HDL: 20.500.12708/222828 / Project: CalgSAT
- 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.
And more…
Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.
Until then, please visit Daniela’s research profile in TISS.