team |
[ research | publications | talks | office | contact | address ] ## Dr. Daniela KaufmannFrom July 2016 until April 2020, I was a Ph.D. student of
Computer Science at JKU, supervised
by Prof. Armin Biere. ## Research Interests- Arithmetic Circuit Verification
- Computer Algebra
- Algebraic Proof Systems
- Rigorous Systems Engineering
## PublicationsA list of my publications can be found here: PublicationsNote: some of them are published under my maiden name 'Ritirc'. ## Talk Slides- The Proof Checkers Pacheck and PastÃ¨que for the Practical Algebraic Calculus , FMCAD 2020, (online).
- Formal Verification of Integer Multiplier Circuits using Computer Algebra , Keynote ISWSBP 2020, (online).
- Nullstellensatz-Proofs for Multiplier Verification , CASC 2020, (online).
- Formal Verification of Multiplier Circuits using Computer Algebra , PhD Defense 2020, Johannes Kepler University, Linz, Austria.
- From DRUP to PAC and Back , DATE 2020 (online), Grenoble, France.
- Combining SAT and Computer Algebra to Successfully Verify Large Multiplier Circuits , PLunch Talk 2019, Carnegie Mellon University, Pittsburgh, PA, USA.
- Combining SAT and Computer Algebra to successfully verify Large Multiplier Circuits , BARC Talk 2019, University of Copenhagen, Copenhagen, Denmark.
- Verifying Large Multipliers by Combining SAT and Computer Algebra , FMCAD 19, San Jose, CA, USA.
- A Practical Polynomial Calculus for Arithmetic Circuit Verification , SC-2 Workshop at FLoC 2018 , Oxford, United Kingdom.
- On the Problem of Arithmetic Circuit Verification Using Computer Algebra, Theory Reading Group Meeting 2018, KTH Royal Institute of Technology, Stockholm, Sweden.
- Column-Wise Verification of Multipliers Using Computer Algebra, FMCAD 2017, Vienna, Austria.
- Complexity of Circuit Ideal Membership Testing, SC-2 Workshop 2017, Kaiserslautern, Germany.
## OfficeScience Park 3 (SCP3), 2nd
Floor ## Contactdaniela.kaufmann@jku.at ## AddressInstitute for Formal Models and Verification |