Sciweavers

    ASPDAC
    2008
    ACM
    106views Hardware» more  ASPDAC 2008»
    Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof
    14 years 21 days ago
    Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof
    Download  www.cecs.uci.edu
    —In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
    Udo Krautz, Markus Wedler, Wolfgang Kunz, Kai Webe...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.