This chapter provides the background on Boolean Satisfiability (SAT) necessary for the description, in the next chapter, of an ATPG engine based on SAT. The main concepts of SAT solvers are reviewed in Section 3.1. An overview of advanced SAT techniques is given in Section 3.2. In Section 3.3, the standard transformation of a given circuit into constraints for a SAT solver is introduced. Finally, Section 3.4 provides a short overview of circuit-oriented SAT techniques.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2009). Boolean Satisfiability. In: Test Pattern Generation using Boolean Proof Engines. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-2360-5_3
Download citation
DOI: https://doi.org/10.1007/978-90-481-2360-5_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-2359-9
Online ISBN: 978-90-481-2360-5
eBook Packages: EngineeringEngineering (R0)