Verifying Dividers Using Symbolic Computer Algebra and Don’t Care Optimization

  • Alireza Mahzoon (Speaker)
  • Christoph Scholl (Speaker)
  • Alexander Konrad (Speaker)
  • Große, D. (Speaker)
  • Rolf Drechsler (Speaker)

Activity: Talk or presentation › Contributed talk › science-to-science

Description

In this paper we build on methods based on Symbolic Computer Algebra that have been applied successfully to multiplier verification and more recently to divider verification as well. We show that existing methods are not sufficient to verify optimized non-restoring dividers and we enhance those methods by a novel optimization method for polynomials w. r. t. satisfiability don’t cares. The optimization is reduced to Integer Linear Programming (ILP). Our experimental results show that this method is the key for enabling the verification of large and optimized non-restoring dividers (with bit widths up to 512).
Period02 Feb 2021
Event titleDesign, Automation and Test in Europe (DATE)
Event typeConference
LocationAustriaShow on map

Fields of science

  • 202017 Embedded systems
  • 202005 Computer architecture
  • 102005 Computer aided design (CAD)
  • 102 Computer Sciences
  • 102011 Formal languages

JKU Focus areas

  • Digital Transformation

Documents & Links