Lennart Weingarten
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Lennart Weingarten has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Kamalika Datta
Cyber-Physical Systems, DFKI GmbH, Bremen, Germany
4 shared publications - Rolf Drechsler
Faculty 03 Mathematics and Computer Science, University of Bremen
4 shared publications - Abhoy Kole
Cyber-Physical Systems, DFKI GmbH, Bremen, Germany
2 shared publications Kamalika Datta
1 shared publication- Mohammed Elkacem Djeridane
Institute of Computer Science, University of Bremen, Bremen, Germany and Siemens EDA GmbH, Hamburg, Germany
1 shared publication Rolf Drechsler
1 shared publication
Latest Publications
- 11 May 2026
- Published by Springer Nature
- p. 504-519
Ensuring Correctness Efficiently for RISC-V Processors with Customised Multiplier Designs
- 11 May 2026
- Published by Springer Nature
- p. 504-519
Ensuring Correctness Efficiently for RISC-V Processors with Customised Multiplier Designs
- 13 April 2026
- Published by Springer Nature in SN Computer Science
- Vol. 7 (4)
Formally Verifying Multiply-and-Accumulate Architectures Using Symbolic Computer Algebra
- 13 April 2026
- Published by Springer Nature in SN Computer Science
- Vol. 7 (4)
Formally Verifying Multiply-and-Accumulate Architectures Using Symbolic Computer Algebra
- Open Access
- 30 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Journal on Emerging Technologies in Computing Systems
- Vol. 21 (2) , 1-15
qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking
The use of Boolean Satisfiability (SAT) solver for hardware verification incurs exponential runtime in several instances. In this work, we have proposed an efficient quantum SAT (qSAT) solver for equivalence checking of Boolean circuits employing Grover’s algorithm. The Exclusive-Sum-of-Product (ESOP)-based generation of the Conjunctive Normal Form (CNF) equivalent clauses demands less qubits and minimizes the gates and depth of quantum circuit interpretation. The consideration of reference circuits for verification affecting Grover’s iterations and quantum resources are also presented as a case study. Experimental results are presented assessing the benefits of the proposed verification approach using open source Qiskit platform and IBM quantum computer.
- 30 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Journal on Emerging Technologies in Computing Systems
- Vol. 21 (2) , 1-15
Open AccessqSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking
The use of Boolean Satisfiability (SAT) solver for hardware verification incurs exponential runtime in several instances. In this work, we have proposed an efficient quantum SAT (qSAT) solver for equivalence checking of Boolean circuits employing Grover’s algorithm. The Exclusive-Sum-of-Product (ESOP)-based generation of the Conjunctive Normal Form (CNF) equivalent clauses demands less qubits and minimizes the gates and depth of quantum circuit interpretation. The consideration of reference circuits for verification affecting Grover’s iterations and quantum resources are also presented as a case study. Experimental results are presented assessing the benefits of the proposed verification approach using open source Qiskit platform and IBM quantum computer.
- 5 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanotechnology
- Vol. 24 (1536125X) , 140-151
Polynomial Formal Verification of a RISC-V Processor
Verification plays a major role in ensuring the functional correctness of any design. In recent years with growing complexity of processor designs, verification has assumed utmost importance. Simulation-based techniques cannot ensure completeness in verification, and in this regard formal methods prove crucial. Although formal methods guarantee completeness it is hard to quantify the exact time and space complexities. Recently some works have demonstrated that it is possible to achieve polynomial space and time complexities for various arithmetic circuits as well as for processors. In this paper we propose a Binary Decision Diagram (BDD) based Polynomial Formal Verification (PFV) approach for verifying processors. As a case study, we discuss the PFV for a multi-cycle processor (viz., MicroRV32) with support for combinational and sequential sub-systems. New data structures and code base are utilized to verify all the functional components. Experimental results reveal that the verification can indeed be performed in polynomial time.
- 5 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanotechnology
- Vol. 24 (1536125X) , 140-151
Polynomial Formal Verification of a RISC-V Processor
Verification plays a major role in ensuring the functional correctness of any design. In recent years with growing complexity of processor designs, verification has assumed utmost importance. Simulation-based techniques cannot ensure completeness in verification, and in this regard formal methods prove crucial. Although formal methods guarantee completeness it is hard to quantify the exact time and space complexities. Recently some works have demonstrated that it is possible to achieve polynomial space and time complexities for various arithmetic circuits as well as for processors. In this paper we propose a Binary Decision Diagram (BDD) based Polynomial Formal Verification (PFV) approach for verifying processors. As a case study, we discuss the PFV for a multi-cycle processor (viz., MicroRV32) with support for combinational and sequential sub-systems. New data structures and code base are utilized to verify all the functional components. Experimental results reveal that the verification can indeed be performed in polynomial time.
- Open Access
- 18 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-6
PolyMiR: Polynomial Formal Verification of the MicroRV32 Processor
Formal verification techniques ensure completeness as opposed to simulation-based techniques. In general, the process of formal verification is computationally complex, and it is difficult to quantify the exact time and space complexities. Some of the recent works have shown that it is possible to achieve polynomial space and time complexities for verifying specific designs, like arithmetic circuits. However, this cannot be directly extended to complex circuits, like processors. A recent work has reported a formal verification method for the RISC-V processor with polynomial complexity, where only single-cycle instruction execution was considered and it was computation intensive. This method cannot be directly extended to multi-cycle operations, which are typical for most real processors. This paper introduces an improved data structure leading to Binary Decision Diagram (BDD) based Polynomial Formal Verification (PFV) with support for both single-cycle and multi-cycle operations. We use the MicroRV32 processor as a case study. Our method leads to significant improvement in runtime over the previous method. The entire process of verification can be carried out in polynomial space and time complexities for multi-cycle operations.
- 18 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessPolyMiR: Polynomial Formal Verification of the MicroRV32 Processor
Formal verification techniques ensure completeness as opposed to simulation-based techniques. In general, the process of formal verification is computationally complex, and it is difficult to quantify the exact time and space complexities. Some of the recent works have shown that it is possible to achieve polynomial space and time complexities for verifying specific designs, like arithmetic circuits. However, this cannot be directly extended to complex circuits, like processors. A recent work has reported a formal verification method for the RISC-V processor with polynomial complexity, where only single-cycle instruction execution was considered and it was computation intensive. This method cannot be directly extended to multi-cycle operations, which are typical for most real processors. This paper introduces an improved data structure leading to Binary Decision Diagram (BDD) based Polynomial Formal Verification (PFV) with support for both single-cycle and multi-cycle operations. We use the MicroRV32 processor as a case study. Our method leads to significant improvement in runtime over the previous method. The entire process of verification can be carried out in polynomial space and time complexities for multi-cycle operations.