Proceedings ArticleDOI
Chaff: engineering an efficient SAT solver
Matthew W. Moskewicz,Conor F. Madigan,Ying Zhao,Lintao Zhang,Sharad Malik +4 more
- pp 530-535
TLDR
The development of a new complete solver, Chaff, is described which achieves significant performance gains through careful engineering of all aspects of the search-especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy.Abstract:
Boolean satisfiability is probably the most studied of the combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in electronic design automation (EDA), as well as in artificial intelligence (AI). This study has culminated in the development of several SAT packages, both proprietary and in the public domain (e.g. GRASP, SATO) which find significant use in both research and industry. Most existing complete solvers are variants of the Davis-Putnam (DP) search algorithm. In this paper we describe the development of a new complete solver, Chaff which achieves significant performance gains through careful engineering of all aspects of the search-especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy. Chaff has been able to obtain one to two orders of magnitude performance improvement on difficult SAT benchmarks in comparison with other solvers (DP or otherwise), including GRASP and SATO.read more
Citations
More filters
Journal Article
Detecting State Encoding Conflicts in STG Unfoldings Using SAT
TL;DR: This work avoids constructing the state graph of an STG, which can lead to state space explosion, and instead uses only the information about causality and structural conflicts between the events involved in a finite and complete prefix of its unfolding, which leads to huge memory savings when compared to methods based on state graphs, but also to significant speedups.
Book ChapterDOI
A compact encoding of pseudo-boolean constraints into SAT
TL;DR: This work presents a novel small sized and simple to implement encoding for pseudo-Boolean constraints into the Boolean satisfiability problem that maintains generalized arc consistency by unit propagation and results in a formula in conjunctive normal form that is linear in size with respect to the number of input variables.
Journal ArticleDOI
Minimizing the number of paths in BDDs: Theory and algorithm
Görschwin Fey,Rolf Drechsler +1 more
TL;DR: Connections to different areas in computer-aided design are outlined, theoretical studies are carried out, and an algorithm to minimize the number of paths is presented and experimental results show the efficiency of the algorithm.
Proceedings ArticleDOI
WoLFram- A Word Level Framework for Formal Verification
TL;DR: The word level framework WoL Fram is presented that enables the development of applications for formal verification of systems independent of the underlying proof technique, and makes WoLFram a stable backbone for the development and quick evaluation of emerging verification techniques.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Tabu Search—Part II
TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
Book ChapterDOI
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
Book
A machine program for theorem-proving
TL;DR: The programming of a proof procedure is discussed in connection with trial runs and possible improvements.