Daniela Kaufmann

Publications

daniela.kaufmann@tuwien.ac.at — Mon, 14 Sep 2026 00:00:00 +0000

Selected Invited Talks & Seminar Talks

daniela.kaufmann@tuwien.ac.at — Fri, 04 Sep 2026 00:00:00 +0000

POLARIS

daniela.kaufmann@tuwien.ac.at — Tue, 11 Aug 2026 00:00:00 +0000

ERC Starting Grant 2026

Advancing Polynomial and Logical Approaches for Trusted Automated Reasoning over Integrated Systems

In today’s digital world, the correctness of systems is not optional; it is essential. From hardware circuits in medical devices and aircraft to cryptographic protocols securing our data, the systems that underpin society demand absolute precision down to the level of individual bits. Formal verification employs rigorous mathematical techniques and logical reasoning to guarantee that such systems behave exactly as intended.

A wide range of central verification tasks, including proving the correctness of hardware circuits, analyzing cryptographic encodings, and reasoning about bit-vectors that model computer memory, can be naturally encoded as non-linear polynomials over finite variable domains. State-of-the-art reasoning approaches, such as satisfiability modulo theory solvers, however, reduce these tasks to propositional reasoning on the bit-level and apply satisfiability solving, which becomes infeasible when confronted with the complexity of modern systems involving non-linear arithmetic and large state spaces.

POLARIS addresses this bottleneck by developing a new generation of trusted verification techniques that operate directly on polynomial representations while preserving bit-level accuracy. Central to this vision is the tight integration of algebraic methods for word-level reasoning with established bit-level approaches, combined with proof logging that produces machine-checkable certificates. This ensures that every verification result is both scalable and independently trustworthy.

Reaching this ambitious goal will enable verification capabilities that are currently unattainable, in particular for complex arithmetic circuits, cryptographic protocols, and low-level memory models with high arithmetic complexity. By advancing the theoretical foundations and practical algorithms for bit-precise reasoning, the project will extend the frontier of formal verification and decisively strengthen the reliability and trustworthiness of future digital systems.

Authors

daniela.kaufmann@tuwien.ac.at — Mon, 01 Jan 0001 00:00:00 +0000

Awards

daniela.kaufmann@tuwien.ac.at — Mon, 01 Jan 0001 00:00:00 +0000

Research Grants

ERC Starting Grant — POLARIS - Advancing Polynomial and Logical Approaches for Trusted Automated Reasoning over Integrated Systems, 01/2027–12/2031, Principal Investigator, funded by European Research Council (1 500 000 Euro).
FWF ESPRIT — CalgSAT - Combining Computer Algebra with SAT for Word-Level Reasoning, 06/2024–05/2027, Principal Investigator, funded by Austrian Science Fund FWF (350 000 Euro).

Awards

Generation Future Frauen Förderpreis, 2nd place, ORF & Infineon (2022)
Heinz Zemanek Award, Austrian Computer Society (2022)
GI-Dissertation Award, Gesellschaft für Informatik (2021)
JKU Young Researchers' Award, JKU Linz (2020)

Best Paper Awards

Best Paper Award at MEDI for "Fuzzing-Based Grammar Inference" (2023)
Best Paper Award at FMCAD for "Column-Wise Verification of Multipliers Using Computer Algebra" (2017)

Service

daniela.kaufmann@tuwien.ac.at — Mon, 01 Jan 0001 00:00:00 +0000

Steering Committee Memberships

2027–ongoing — ETAPS, Artifact Evaluation Coordinator
2024–2027 — SC2

Chairing

2025 — FMCAD, Program Chair
2025 — TACAS, Artifact Evaluation Chair
2025 — iFM, Artifact Evaluation Chair
2024 — SC2, Program Chair
2024 — SAT, Workshop Chair
2024 — iFM, Artifact Evaluation Chair

Organization

2026 — BIRS Seminar: Theory and Practice of SAT and Combinatorial Solving (26w5626), Co-Organizer, Banff International Research Station, Banff, Alberta, Canada
2025 — Dagstuhl Seminar: Certifying Algorithms for Automated Reasoning (25231), Co-Organizer, Schloss Dagstuhl, Wadern, Germany

Editorial Tasks

Ongoing — FMSD: Special Issue on Selected Papers of FMCAD 2025, Springer
Ongoing — Sci. Comput. Program.: Original Software Publications - Selected Software Artifacts from the Papers of iFM 2025, Elsevier

Program Committee Memberships

2026 — FMCAD, IJCAR, IWIL, LPAR, PAAR, TACAS, VSTTE, WHOOPS
2025 — ECAI (Senior PC), SAT
2024 — ATVA, CP, FMCAD, IJCAR, MBMV, PAAR, SAT, SEFM, SMT, VMCAI
2023 — CICM, FMCAD, FMCAD Student Forum, IWIL, MBMV, SAT, SBMF, SEFM, SMT
2022 — SC2, FMCAD Student Forum

Artifact Evaluation Committee Memberships

2023 — CAV
2022 — CAV, TACAS
2021 — TACAS

Journal Reviewer

Reviewed manuscripts for TCAD, FMSD, JSSM, TOC, ETS.

Jury Member

2025 — VCLA International Student Awards
2024 — VCLA International Student Awards

Daniela Kaufmann

Publications

Selected Invited Talks & Seminar Talks

POLARIS

ERC Starting Grant 2026

Advancing Polynomial and Logical Approaches for Trusted Automated Reasoning over Integrated Systems

Authors

Awards

Research Grants

Awards

Best Paper Awards

Service

Steering Committee Memberships

Chairing

Organization

Editorial Tasks

Program Committee Memberships

Artifact Evaluation Committee Memberships

Journal Reviewer

Jury Member

Member of Professional Organizations