Daniela Kaufmann

32 papers A 3B 5C 1Journal 14Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Avoiding Big Integers: Parallel Multimodular Algebraic Verification of Arithmetic Circuits. CoRR Clemens Hofstadler, Daniela Kaufmann, Chen Chen
2026	—	`conf`	ReVEAL: GNN-Guided Reverse Engineering for Formal Verification of Optimized Multipliers. TACAS (2) Chen Chen, Daniela Kaufmann, Chenhui Deng, Zhan Song, Hongce Zhang, Cunxi Yu
2025	J	`jnl`	Certifying Algorithms for Automated Reasoning (Dagstuhl Seminar 25231). Dagstuhl Reports Nikolaj S. Bjørner, Marijn J. H. Heule, Daniela Kaufmann, Jakob Nordström, Wietze Koops
2025	—	`conf`	Extracting Linear Relations from Gröbner Bases for Formal Verification of And-Inverter Graphs. TACAS (1) Daniela Kaufmann, Jérémy Berthomieu
2025	A	`conf`	Guess and Prove: A Hybrid Approach to Linear Polynomial Recovery in Circuit Verification. CP Clemens Hofstadler, Daniela Kaufmann
2025	B	`ed.`	Proceedings of the 25th Conference on Formal Methods in Computer-Aided Design, FMCAD 2025, Menlo Park, CA, USA, October 6-10, 2025 FMCAD Ahmed Irfan, Daniela Kaufmann
2025	J	`jnl`	ReVEAL: GNN-Guided Reverse Engineering for Formal Verification of Optimized Multipliers. CoRR Chen Chen, Daniela Kaufmann, Chenhui Deng, Zhan Song, Hongce Zhang, Cunxi Yu
2025	—	`conf`	Recycling Algebraic Proof Certificates. SC-Square@CADE Daniela Kaufmann, Clemens Hofstadler
2025	J	`jnl`	Recycling Algebraic Proof Certificates. CoRR Daniela Kaufmann, Clemens Hofstadler
2024	J	`jnl`	Extracting Linear Relations from Gröbner Bases for Formal Verification of And-Inverter Graphs. CoRR Daniela Kaufmann, Jérémy Berthomieu
2024	J	`jnl`	Fuzzing-based grammar learning from a minimal set of seed inputs. J. Comput. Lang. Hannes Sochor, Flavio Ferrarotti, Daniela Kaufmann
2024	—	`ed.`	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. PAAR+SC²@IJCAR Christopher W. Brown, Daniela Kaufmann, Cláudia Nalon, Alexander Steen, Martin Suda
2024	J	`jnl`	Life span of SAT techniques. CoRR Mathias Fleury, Daniela Kaufmann
2024	—	`conf`	MCSat-Based Finite Field Reasoning in the Yices2 SMT Solver (Short Paper). IJCAR (1) Thomas Hader, Daniela Kaufmann, Ahmed Irfan, Stéphane Graham-Lengrand, Laura Kovács
2024	J	`jnl`	MCSat-based Finite Field Reasoning in the Yices2 SMT Solver. CoRR Thomas Hader, Daniela Kaufmann, Ahmed Irfan, Stéphane Graham-Lengrand, Laura Kovács
2024	—	`conf`	PolySAT: Word-level Bit-vector Reasoning in Z3. VSTTE Jakob Rath, Clemens Eisenhofer, Daniela Kaufmann, Nikolaj S. Bjørner, Laura Kovács
2024	J	`jnl`	PolySAT: Word-level Bit-vector Reasoning in Z3. CoRR Jakob Rath, Clemens Eisenhofer, Daniela Kaufmann, Nikolaj S. Bjørner, Laura Kovács
2024	J	`jnl`	Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker. Formal Methods Syst. Des. Daniela Kaufmann, Mathias Fleury, Armin Biere, Manuel Kauers
2023	J	`jnl`	Improving AMulet2 for verifying multiplier circuits using SAT solving and computer algebra. Int. J. Softw. Tools Technol. Transf. Daniela Kaufmann, Armin Biere
2023	B	`conf`	SMT Solving over Finite Field Arithmetic. LPAR Thomas Hader, Daniela Kaufmann, Laura Kovács
2023	J	`jnl`	SMT Solving over Finite Field Arithmetic. CoRR Thomas Hader, Daniela Kaufmann, Laura Kovács
2022	A	`conf`	Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification. DATE Daniela Kaufmann, Paul Beame, Armin Biere, Jakob Nordström
2022	—	`conf`	Fuzzing and Delta Debugging And-Inverter Graph Verification Tools. TAP@STAF Daniela Kaufmann, Armin Biere
2022	C	`conf`	Fuzzing-Based Grammar Inference. MEDI Hannes Sochor, Flavio Ferrarotti, Daniela Kaufmann
2021	—	`conf`	AMulet 2.0 for Verifying Multiplier Circuits. TACAS (2) Daniela Kaufmann, Armin Biere
2020	—	`ch.`	Formale Verifikation von Multiplizierern mit Computeralgebra. Ausgezeichnete Informatikdissertationen Daniela Kaufmann
2020	A	`conf`	From DRUP to PAC and Back. DATE Daniela Kaufmann, Armin Biere, Manuel Kauers
2020	J	`jnl`	Incremental column-wise verification of arithmetic circuits using computer algebra. Formal Methods Syst. Des. Daniela Kaufmann, Armin Biere, Manuel Kauers
2020	B	`conf`	Nullstellensatz-Proofs for Multiplier Verification. CASC Daniela Kaufmann, Armin Biere
2020	J	`jnl`	Practical Algebraic Calculus Checker. Arch. Formal Proofs Mathias Fleury, Daniela Kaufmann
2020	B	`conf`	The Proof Checkers Pacheck and Pastèque for the Practical Algebraic Calculus. FMCAD Daniela Kaufmann, Mathias Fleury, Armin Biere
2019	B	`conf`	Verifying Large Multipliers by Combining SAT and Computer Algebra. FMCAD Daniela Kaufmann, Armin Biere, Manuel Kauers

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.