default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniela Kaufmann
Person information
- affiliation: TU Wien, Vienna, Austria
- affiliation: Johannes Kepler University, Linz, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Hannes Sochor
, Flavio Ferrarotti, Daniela Kaufmann:
Fuzzing-based grammar learning from a minimal set of seed inputs. J. Comput. Lang. 78: 101252 (2024)- [c15]Thomas Hader, Daniela Kaufmann, Ahmed Irfan, Stéphane Graham-Lengrand, Laura Kovács:
MCSat-Based Finite Field Reasoning in the Yices2 SMT Solver (Short Paper). IJCAR (1) 2024: 386-395 - [e1]Christopher W. Brown, Daniela Kaufmann, Cláudia Nalon, Alexander Steen, Martin Suda:
Joint Proceedings of the 9th Workshop on Practical Aspects of Automated Reasoning (PAAR) and the 9th Satisfiability Checking and Symbolic Computation Workshop (SC-Square), 2024 co-located with the 12th International Joint Conference on Automated Reasoning (IJCAR 2024), Nancy, France, July 2, 2024. CEUR Workshop Proceedings 3717, CEUR-WS.org 2024 [contents] - [i4]Mathias Fleury, Daniela Kaufmann:
Life span of SAT techniques. CoRR abs/2402.01202 (2024) - [i3]Thomas Hader, Daniela Kaufmann, Ahmed Irfan, Stéphane Graham-Lengrand, Laura Kovács:
MCSat-based Finite Field Reasoning in the Yices2 SMT Solver. CoRR abs/2402.17927 (2024) - [i2]Jakob Rath, Clemens Eisenhofer, Daniela Kaufmann, Nikolaj S. Bjørner, Laura Kovács:
PolySAT: Word-level Bit-vector Reasoning in Z3. CoRR abs/2406.04696 (2024) - 2023
- [j3]Daniela Kaufmann, Armin Biere:
Improving AMulet2 for verifying multiplier circuits using SAT solving and computer algebra. Int. J. Softw. Tools Technol. Transf. 25(2): 133-144 (2023) - [c14]Thomas Hader, Daniela Kaufmann, Laura Kovács:
SMT Solving over Finite Field Arithmetic. LPAR 2023: 238-256 - [i1]Thomas Hader, Daniela Kaufmann, Laura Kovács:
SMT Solving over Finite Field Arithmetic. CoRR abs/2305.00028 (2023) - 2022
- [c13]Daniela Kaufmann, Paul Beame, Armin Biere, Jakob Nordström:
Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification. DATE 2022: 1431-1436 - [c12]Hannes Sochor, Flavio Ferrarotti, Daniela Kaufmann:
Fuzzing-Based Grammar Inference. MEDI 2022: 72-86 - [c11]Daniela Kaufmann, Armin Biere:
Fuzzing and Delta Debugging And-Inverter Graph Verification Tools. TAP@STAF 2022: 69-88 - 2021
- [c10]Daniela Kaufmann, Armin Biere:
AMulet 2.0 for Verifying Multiplier Circuits. TACAS (2) 2021: 357-364 - 2020
- [j2]Mathias Fleury, Daniela Kaufmann:
Practical Algebraic Calculus Checker. Arch. Formal Proofs 2020 (2020) - [j1]Daniela Kaufmann, Armin Biere, Manuel Kauers:
Incremental column-wise verification of arithmetic circuits using computer algebra. Formal Methods Syst. Des. 56(1): 22-54 (2020) - [c9]Daniela Kaufmann, Armin Biere:
Nullstellensatz-Proofs for Multiplier Verification. CASC 2020: 368-389 - [c8]Daniela Kaufmann, Armin Biere, Manuel Kauers:
From DRUP to PAC and Back. DATE 2020: 654-657 - [c7]Daniela Kaufmann, Mathias Fleury, Armin Biere:
The Proof Checkers Pacheck and Pastèque for the Practical Algebraic Calculus. FMCAD 2020: 264-269 - [p1]Daniela Kaufmann:
Formale Verifikation von Multiplizierern mit Computeralgebra. Ausgezeichnete Informatikdissertationen 2020: 169-178
2010 – 2019
- 2019
- [c6]Daniela Kaufmann, Armin Biere, Manuel Kauers:
Verifying Large Multipliers by Combining SAT and Computer Algebra. FMCAD 2019: 28-36 - [c5]Daniela Ritirc, Armin Biere, Manuel Kauers:
SAT, Computer Algebra, Multipliers. Vampire 2019: 1-18 - 2018
- [c4]Daniela Ritirc, Armin Biere, Manuel Kauers:
Improving and extending the algebraic approach for verifying gate-level multipliers. DATE 2018: 1556-1561 - [c3]Daniela Ritirc, Armin Biere, Manuel Kauers:
A Practical Polynomial Calculus for Arithmetic Circuit Verification. SC-Square@FLOC 2018: 61 - 2017
- [c2]Daniela Ritirc, Armin Biere, Manuel Kauers:
Column-wise verification of multipliers using computer algebra. FMCAD 2017: 23-30 - [c1]Armin Biere, Manuel Kauers, Daniela Ritirc:
Challenges in Verifying Arithmetic Circuits Using Computer Algebra. SYNASC 2017: 9-15
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 17:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
