In this chapter,1 branching strategies for SAT-based ATPG algorithms are presented. In Section 8.1, the concepts of the standard SAT solver decision heuristics are reviewed, while in Section 8.2, a combination of decision strategies from a structure-based algorithm and from a SAT solver is discussed. Standard SAT solver decision strategies as well as a structural branching strategy are experimentally evaluated in Section 8.3. A summary is presented in the last section.
This is a preview of subscription content, log in via an institution to check access.
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). Branching Strategies. In: Test Pattern Generation using Boolean Proof Engines. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-2360-5_8
Download citation
DOI: https://doi.org/10.1007/978-90-481-2360-5_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-2359-9
Online ISBN: 978-90-481-2360-5
eBook Packages: EngineeringEngineering (R0)