Open AccessProceedings Article
Encoding Global Unobservability for Efficient Translation to SAT.
Reads0
Chats0
TLDR
The results show that global unobservability constraints lead to small additional speedup if local unobservable is exploited, but make the SAT-time less dependent on values of parameters in the translation.Abstract:
The paper studies the use of global unobservability constraints in a CNF translation of Boolean formulas, where the unobservability of logic blocks is encoded with CNF unobservability variables and the logic output values of the blocks with CNF logic variables. Each block’s unobservability variable is restricted by local unobservability constraints, expressing conditions that the output value of the block will not propagate to the primary output, given values of inputs to nearby gates on the path to the primary output. Global unobservability constraints add conditions that a block is unobservable if all paths to the primary output pass through logic blocks that are unobservable. By introducing a cut of unobservability check-points at the inputs of the top gate in a Boolean formula, we can impose global unobservability constraints for every logic block. The results show that global unobservability constraints lead to small additional speedup if local unobservability is exploited, but make the SAT-time less dependent on values of parameters in the translation.read more
Citations
More filters
Proceedings ArticleDOI
Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions
Zhaohui Fu,Sharad Malik +1 more
TL;DR: An efficient algorithm (CNF2CKT) for extracting circuit information from CNF instances that is optimal in the sense that it extracts a maximum acyclic combinational circuit from any given CNF using the logic gates pre-specified in a library.
Journal Article
Formal verification of VLIW microprocessors with speculative execution
TL;DR: This is a study of the formal verification of a VLIW microprocessor that imitates the Intel Itanium in features such as predicated execution, register remapping, advanced and speculative loads, and branch prediction.
Proceedings ArticleDOI
Considering Circuit Observability Don't Cares in CNF Satisfiability
TL;DR: A broader approach that adds certain don't care literals to clauses in the CNF representation is proposed that can be implemented in the zChaff SAT solver and experiments show that significant performance gain can be obtained.
Book ChapterDOI
Optimizations for compiling declarative models into boolean formulas
TL;DR: This paper presents the experience using several mechanical techniques that enable the Alloy Analyzer to generate optimized SAT formulas from first-order logic formulas, suggesting the potential presence of underlying connections between optimization problems from two very different domains.
Journal ArticleDOI
Improved SAT-based Reachability Analysis with Observability Don't Cares
TL;DR: This work presents an efficient way to identify ODCs, proves the correctness of leaving ODC variables unassigned, and develops a reachability analysis platform that benefits greatly from the ODC’s.
References
More filters
Book
Computer Architecture: A Quantitative Approach
TL;DR: This best-selling title, considered for over a decade to be essential reading for every serious student and practitioner of computer design, has been updated throughout to address the most important trends facing computer designers today.
Proceedings ArticleDOI
Chaff: engineering an efficient SAT solver
TL;DR: 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.
Book
Digital Systems Testing and Testable Design
TL;DR: The new edition of Breuer-Friedman's Diagnosis and Reliable Design ofDigital Systems offers comprehensive and state-ofthe-art treatment of both testing and testable design.
Book ChapterDOI
On the Complexity of Derivation in Propositional Calculus
TL;DR: In this paper, the minimum complexity of derivation of a given formula in classical propositional calculus is considered and it is proved that estimates of complexity may vary considerably among the various forms of propositional logic.
Proceedings ArticleDOI
BerkMin: A Fast and Robust Sat-Solver
Eugene Goldberg,Yakov Novikov +1 more
TL;DR: A SAT-solver is described that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause "aging" and introduces a new decision making procedure and a new method of clause database management.