Skip to content

Author

Lennart Weingarten

We have 3 of 16 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Sep 2026

Polynomial Formal Verification of Structurally Simple Multipliers

Formal verification of integer multipliers remains a challenging problem in electronic design automation, as logic-based approaches such as Satisfiability Solvers (SAT) and Binary Decision Diagrams (BDDs) often scale poorly on such circuitry. In recent times, Polynomial Formal Verification (PFV) has been investigated f...

Jan Kleinekathofer, Lennart Weingarten, Kamalika Datta et al. · 0 citations
Preprint Aug 2026

TRACE: Traversal and Reasoning Algebraic Computing Engine for Formal Hardware Verification

To overcome the state-explosion problem inherent in polynomial expansion, the engine incorporates advanced reduction techniques, including optimized traversal strategies, conflict removal, and polarity-based optimization for compact symbolic representations.

Jan Kleinekathöfer, Lennart Weingarten, Kamalika Datta et al. · 0 citations

A Conflict-Aware Learning Approach to SCA Verification for MAC Architectures

This work designs an SCA-based proof engine that exploits a conflict-aware learning approach that compresses the intermediate polynomial expression and successfully verifies circuits that remained unverifiable using previous approaches.

Jan Kleinekath ̈ofer, Lennart Weingarten, Kamalika Datta et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.