A Circuit SAT Solver With Signal Correlation Guided Learning

Authors:
Feng Lu;Li-C. Wang;Kwang-Ting Cheng;Ric C-Y Huang
Affiliations:
University of California at Santa Barbara;University of California at Santa Barbara;University of California at Santa Barbara;Verplex Systems, Inc.
Venue:
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Year:
2003

Citing 7
Cited 37

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Circuit-based Boolean Reasoning

Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
SAT with partial clauses and back-leaps

Proceedings of the 39th annual Design Automation Conference
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver

Proceedings of the 39th annual Design Automation Conference
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction

A signal correlation guided ATPG solver and its applications for solving difficult industrial cases

Proceedings of the 40th annual Design Automation Conference
Managing Don't Cares in Boolean Satisfiability

Proceedings of the conference on Design, automation and test in Europe - Volume 1
TranGen: a SAT-based ATPG for path-oriented transition faults

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
SAT-Based Complete Don't-Care Computation for Network Optimization

Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Integration of Learning Techniques into Incremental Satisfiability for Efficient Path-Delay Fault Test Generation

Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
An Efficient Sequential SAT Solver With Improved Search Strategies

Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
An effective and efficient ATPG-based combinational equivalence checker

GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
Utilizing don't care states in SAT-based bounded sequential problems

GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
Dynamic transition relation simplification for bounded property checking

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Debugging sequential circuits using Boolean satisfiability

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Logic transformation and coding theory-based frameworks for Boolean satisfiability

HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
Enhancing SAT-based equivalence checking with static logic implications

HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
Constraint extraction for pseudo-functional scan-based delay testing

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Reducing structural bias in technology mapping

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Post-verification debugging of hierarchical designs

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Verification of large scale nano systems with unreliable nano devices

Nano, quantum and molecular computing
SAT sweeping with local observability don't-cares

Proceedings of the 43rd annual Design Automation Conference
Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability

Proceedings of the 43rd annual Design Automation Conference
Mining global constraints for improving bounded sequential equivalence checking

Proceedings of the 43rd annual Design Automation Conference
Propositional Satisfiability and Constraint Programming: A comparative survey

ACM Computing Surveys (CSUR)
On bounding the delay of a critical path

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Improvements to combinational equivalence checking

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic

Constraints
Merging nodes under sequential observability

Proceedings of the 45th annual Design Automation Conference
SAT graph-based representation: A new perspective

Journal of Algorithms
On the power of top-down branching heuristics

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Hierarchical diagnosis of multiple faults

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts

Proceedings of the 46th Annual Design Automation Conference
Layout-based defect-driven diagnosis for intracell bridging defects

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Circuit based encoding of CNF formula

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
3-valued circuit SAT for STE with automatic refinement

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
MONSOON: SAT-Based ATPG for Path Delay Faults Using Multiple-Valued Logics

Journal of Electronic Testing: Theory and Applications
Incremental solving techniques for SAT-based ATPG

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Diagnosis-assisted supply voltage configuration to increase performance yield of cell-based designs

Proceedings of the 16th Asia and South Pacific Design Automation Conference
Sechecker: a sequential equivalence checking framework based on K th invariants

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Solving quantified boolean formulas with circuit observability don't cares

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Efficient self-learning techniques for SAT-based test generation

Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Boolean Satistifiability has attracted tremendous research effort in recent years, resulting in the developments of various efficient SAT solver packages. Based upon their design architectures, researchers have tried to develop better heuristics to further improve its efficiency, by either speeding up the Boolean Constraint Propagation (BCP) procedure or finding a better decision ordering (or both). In this paper, we propose an entirely different SAT solver design concept that is circuit-based. Our solver is able to utilize circuit topological information and signal correlations to enforce a decision ordering that is more efficient for solving circuit-based SAT problem instances. In particular, for unsatisfiable circuit examples, our solver is able to achieve from 2x up to more than 75x speedup over a state-of-the-art SAT solver.