SAT with partial clauses and back-leaps

Authors:
Slawomir Pilarski;Gracia Hu
Affiliations:
Synopsys, Inc., Hillsboro, OR;Synopsys, Inc., Hillsboro, OR
Venue:
Proceedings of the 39th annual Design Automation Conference
Year:
2002

Citing 15
Cited 6

A satisfiability-based test generator for path delay faults in combinational circuits

DAC '96 Proceedings of the 33rd annual Design Automation Conference
Sequential logic optimization by redundancy addition and removal

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Satisfiability-based layout revisited: detailed routing of complex FPGAs via search-based Boolean SAT

FPGA '99 Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Boolean satisfiability in electronic design automation

Proceedings of the 37th Annual Design Automation Conference
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW

Proceedings of the 38th annual Design Automation Conference
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
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
Robust Search Algorithms for Test Pattern Generation

FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
Satisfiability-Based Detailed FPGA Routing

VLSID '99 Proceedings of the 12th International Conference on VLSI Design - 'VLSI for the Information Appliance'
Speeding up SAT for EDA

Proceedings of the conference on Design, automation and test in Europe
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
Combinational test generation using satisfiability

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

Journal of Symbolic Computation
A signal correlation guided ATPG solver and its applications for solving difficult industrial cases

Proceedings of the 40th annual Design Automation Conference
Learning from BDDs in SAT-based bounded model checking

Proceedings of the 40th annual Design Automation Conference
A Circuit SAT Solver With Signal Correlation Guided Learning

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Integrating CNF and BDD based SAT solvers

HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
An overview of parallel SAT solving

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents four new powerful SAT optimization techniques: partial clauses, back-leaps, immediate implications and local decisions. These optimization techniques can be combined with SAT mechanisms used in Chaff, SATO, and GRASP to develop a new solver that significantly outperforms its predecessors on a large set of benchmarks. Performance improvements for standard benchmark groups vary from 1.5x to 60x. Performance improvements measured using VLIW microprocessor benchmarks amount to 3.31x.