default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlireza Mahzoon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Alireza Mahzoon, Rolf Drechsler:
Polynomial Formal Verification of Arithmetic Circuits. Found. Trends Electron. Des. Autom. 14(3): 171-244 (2024)- 2023
- [c23]Alireza Mahzoon
, Rolf Drechsler:
Polynomial Formal Verification of Complex Circuits Using a Hybrid Proof Engine. Applicable Formal Methods for Safe Industrial Products 2023: 308-319 - [c22]Rolf Drechsler, Alireza Mahzoon:
Divide and Verify: Using a Divide-and-Conquer Strategy for Polynomial Formal Verification of Complex Circuits. DATE 2023: 1-2 - [c21]Jan Kleinekathöfer, Alireza Mahzoon, Rolf Drechsler:
Polynomial Formal Verification of Floating Point Adders. DATE 2023: 1-2 - [c20]Rolf Drechsler, Alireza Mahzoon:
Towards Polynomial Formal Verification of AI-Generated Arithmetic Circuits. ISDCS 2023: 1-4 - [c19]Lennart Weingarten, Alireza Mahzoon, Mehran Goli, Rolf Drechsler:
Polynomial Formal Verification of a Processor: A RISC-V Case Study. ISQED 2023: 1-7 - 2022
- [b1]Alireza Mahzoon:
Formal verification of structurally complex multipliers. University of Bremen, Germany, 2022, pp. 1-164 - [j3]Alireza Mahzoon, Daniel Große, Rolf Drechsler:
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. 41(5): 1573-1586 (2022) - [c18]Alireza Mahzoon, Daniel Große, Christoph Scholl, Alexander Konrad, Rolf Drechsler:
Formal verification of modular multipliers using symbolic computer algebra and boolean satisfiability. DAC 2022: 1183-1188 - [c17]Rolf Drechsler, Alireza Mahzoon, Mehran Goli:
Towards Polynomial Formal Verification of Complex Arithmetic Circuits. DDECS 2022: 1-6 - [c16]Alexander Konrad, Christoph Scholl, Alireza Mahzoon, Daniel Große, Rolf Drechsler:
Divider Verification Using Symbolic Computer Algebra and Delayed Don't Care Optimization. FMCAD 2022: 1-10 - [c15]Rolf Drechsler, Alireza Mahzoon:
Polynomial Formal Verification: Ensuring Correctness under Resource Constraints. ICCAD 2022: 70:1-70:9 - [c14]Alireza Mahzoon, Rolf Drechsler:
Polynomial Formal Verification of Complex Multipliers. MBMV 2022: 1-4 - [c13]Weiyan Zhang, Mehran Goli, Alireza Mahzoon, Rolf Drechsler:
ANN-based Performance Estimation of Embedded Software for RISC-V Processors. RSP 2022: 22-28 - [c12]Rolf Drechsler, Alireza Mahzoon:
Preserving Design Hierarchy Information for Polynomial Formal Verification. VLSI-SoC 2022: 1-7 - [p1]Alireza Mahzoon:
Formale Verifikation von strukturell komplexen Multiplizierern. Ausgezeichnete Informatikdissertationen 2022: 191-200 - [i1]Jan Kleinekathöfer, Alireza Mahzoon, Rolf Drechsler:
Lower Bound Proof for the Size of BDDs representing a Shifted Addition. CoRR abs/2209.12477 (2022) - 2021
- [c11]Alireza Mahzoon, Rolf Drechsler:
Polynomial Formal Verification of Prefix Adders. ATS 2021: 85-90 - [c10]Alireza Mahzoon, Rolf Drechsler:
Late Breaking Results: Polynomial Formal Verification of Fast Adders. DAC 2021: 1376-1377 - [c9]Christoph Scholl, Alexander Konrad, Alireza Mahzoon, Daniel Große, Rolf Drechsler:
Verifying Dividers Using Symbolic Computer Algebra and Don't Care Optimization. DATE 2021: 1110-1115 - [c8]Mehran Goli, Alireza Mahzoon, Rolf Drechsler:
Automated Debugging-Aware Visualization Technique for SystemC HLS Designs. DSD 2021: 519-526 - [c7]Mohammed Barhoush, Alireza Mahzoon, Rolf Drechsler:
Polynomial word-level verification of arithmetic circuits. MEMOCODE 2021: 1-9 - 2020
- [c6]Alireza Mahzoon, Daniel Große, Christoph Scholl, Rolf Drechsler:
Towards Formal Verification of Optimized and Industrial Multipliers. DATE 2020: 544-549 - [c5]Mehran Goli, Alireza Mahzoon, Rolf Drechsler:
ASCHyRO: Automatic Fault Localization of SystemC HLS Designs Using a Hybrid Accurate Rank Ordering Technique. ICCD 2020: 179-186
2010 – 2019
- 2019
- [c4]Alireza Mahzoon, Daniel Große, Rolf Drechsler:
RevSCA: Using Reverse Engineering to Bring Light into Backward Rewriting for Big and Dirty Multipliers. DAC 2019: 185 - 2018
- [c3]Alireza Mahzoon, Daniel Große, Rolf Drechsler:
PolyCleaner: clean your polynomials before backward rewriting to verify million-gate multipliers. ICCAD 2018: 129 - [c2]Alireza Mahzoon, Daniel Große, Rolf Drechsler:
Combining Symbolic Computer Algebra and Boolean Satisfiability for Automatic Debugging and Fixing of Complex Multipliers. ISVLSI 2018: 351-356 - 2017
- [j2]Alireza Mahzoon, Bijan Alizadeh:
Systematic Design Space Exploration of Floating-Point Expressions on FPGA. IEEE Trans. Circuits Syst. II Express Briefs 64-II(3): 274-278 (2017) - [j1]Alireza Mahzoon, Bijan Alizadeh:
OptiFEX: A Framework for Exploring Area-Efficient Floating Point Expressions on FPGAs With Optimized Exponent/Mantissa Widths. IEEE Trans. Very Large Scale Integr. Syst. 25(1): 198-209 (2017) - 2015
- [c1]Alireza Mahzoon, Bijan Alizadeh:
Multi-objective Optimization of Floating Point Arithmetic Expressions Using Iterative Factorization. ISVLSI 2015: 243-248
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-04 20: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:
