Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets

doi 10.1109/aspdac.2007.358110
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Asynchronous Multi-Core Incremental SAT Solving

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Solving the SAT Problem Using Genetic Algorithm

Advances in Science, Technology and Engineering Systems
EngineeringAstronomyPhysicsManagement of TechnologyInnovation
2017English

Set-Based SAT-solving

Facta universitatis - series: Electronics and Energetics
2007English

Client-Specific Equivalence Checking

2018English

Equivalence Checking of Arithmetic Expressions Using Fast Evaluation

2005English

Efficient Verified (UN)SAT Certificate Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Efficient SAT Solving: Beyond Supercubes

2005English

Functional Fault Equivalence and Diagnostic Test Generation in Combinational Logic Circuits Using Conventional ATPG

Journal of Electronic Testing: Theory and Applications (JETTA)
Electronic EngineeringElectrical
2005English

High-Level vs. RTL Combinational Equivalence: An Introduction

2006 International Conference on Computer Design
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy