Alireza Mahzoon

Orcid: 0000-0001-9342-1098

According to our database1, Alireza Mahzoon authored at least 29 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Polynomial Formal Verification of a Processor: A RISC-V Case Study.
Proceedings of the 24th International Symposium on Quality Electronic Design, 2023

Towards Polynomial Formal Verification of AI-Generated Arithmetic Circuits.
Proceedings of the International Symposium on Devices, Circuits and Systems, 2023

Polynomial Formal Verification of Floating Point Adders.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2023

Divide and Verify: Using a Divide-and-Conquer Strategy for Polynomial Formal Verification of Complex Circuits.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2023

Polynomial Formal Verification of Complex Circuits Using a Hybrid Proof Engine.
Proceedings of the Applicable Formal Methods for Safe Industrial Products, 2023

2022
Formale Verifikation von strukturell komplexen Multiplizierern.
Ausgezeichnete Informatikdissertationen, 2022

Formal verification of structurally complex multipliers.
PhD thesis, 2022

RevSCA-2.0: SCA-Based Formal Verification of Nontrivial Multipliers Using Reverse Engineering and Local Vanishing Removal.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2022

Lower Bound Proof for the Size of BDDs representing a Shifted Addition.
CoRR, 2022

Preserving Design Hierarchy Information for Polynomial Formal Verification.
Proceedings of the 30th IFIP/IEEE 30th International Conference on Very Large Scale Integration, 2022

ANN-based Performance Estimation of Embedded Software for RISC-V Processors.
Proceedings of the IEEE International Workshop on Rapid System Prototyping, 2022

Polynomial Formal Verification of Complex Multipliers.
Proceedings of the Methods and Description Languages for Modelling and Verification of Circuits and Systems, 2022

Polynomial Formal Verification: Ensuring Correctness under Resource Constraints.
Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design, 2022

Divider Verification Using Symbolic Computer Algebra and Delayed Don't Care Optimization.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

Towards Polynomial Formal Verification of Complex Arithmetic Circuits.
Proceedings of the 25th International Symposium on Design and Diagnostics of Electronic Circuits and Systems, 2022

Formal verification of modular multipliers using symbolic computer algebra and boolean satisfiability.
Proceedings of the DAC '22: 59th ACM/IEEE Design Automation Conference, San Francisco, California, USA, July 10, 2022

2021
Polynomial word-level verification of arithmetic circuits.
Proceedings of the MEMOCODE '21: 19th ACM-IEEE International Conference on Formal Methods and Models for System Design, Virtual Event, China, November 20, 2021

Automated Debugging-Aware Visualization Technique for SystemC HLS Designs.
Proceedings of the 24th Euromicro Conference on Digital System Design, 2021

Verifying Dividers Using Symbolic Computer Algebra and Don't Care Optimization.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2021

Late Breaking Results: Polynomial Formal Verification of Fast Adders.
Proceedings of the 58th ACM/IEEE Design Automation Conference, 2021

Polynomial Formal Verification of Prefix Adders.
Proceedings of the 30th IEEE Asian Test Symposium, 2021

2020
ASCHyRO: Automatic Fault Localization of SystemC HLS Designs Using a Hybrid Accurate Rank Ordering Technique.
Proceedings of the 38th IEEE International Conference on Computer Design, 2020

Towards Formal Verification of Optimized and Industrial Multipliers.
Proceedings of the 2020 Design, Automation & Test in Europe Conference & Exhibition, 2020

2019
RevSCA: Using Reverse Engineering to Bring Light into Backward Rewriting for Big and Dirty Multipliers.
Proceedings of the 56th Annual Design Automation Conference 2019, 2019

2018
Combining Symbolic Computer Algebra and Boolean Satisfiability for Automatic Debugging and Fixing of Complex Multipliers.
Proceedings of the 2018 IEEE Computer Society Annual Symposium on VLSI, 2018

PolyCleaner: clean your polynomials before backward rewriting to verify million-gate multipliers.
Proceedings of the International Conference on Computer-Aided Design, 2018

2017
OptiFEX: A Framework for Exploring Area-Efficient Floating Point Expressions on FPGAs With Optimized Exponent/Mantissa Widths.
IEEE Trans. Very Large Scale Integr. Syst., 2017

Systematic Design Space Exploration of Floating-Point Expressions on FPGA.
IEEE Trans. Circuits Syst. II Express Briefs, 2017

2015
Multi-objective Optimization of Floating Point Arithmetic Expressions Using Iterative Factorization.
Proceedings of the 2015 IEEE Computer Society Annual Symposium on VLSI, 2015


  Loading...