Test Pattern Generation using Boolean Proof Engines / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
Used and New from Other Sellers
Used and New from Other Sellers
from $115.42
Usually ships in 1-2 business days
(Save 27%)
Other sellers (Hardcover)
  • All (8) from $115.42   
  • New (6) from $115.42   
  • Used (2) from $158.99   

More About This Textbook


In Test Pattern Generation using Boolean Proof Engines, we give an introduction to ATPG. The basic concept and classical ATPG algorithms are reviewed. Then, the formulation as a SAT problem is considered. As the underlying engine, modern SAT solvers and their use on circuit related problems are comprehensively discussed. Advanced techniques for SAT-based ATPG are introduced and evaluated in the context of an industrial environment. The chapters of the book cover efficient instance generation, encoding of multiple-valued logic, usage of various fault models, and detailed experiments on multi-million gate designs. The book describes the state of the art in the field, highlights research aspects, and shows directions for future work.

Read More Show Less

Product Details

  • ISBN-13: 9789048123599
  • Publisher: Springer Netherlands
  • Publication date: 4/29/2009
  • Edition description: 2009
  • Edition number: 1
  • Pages: 192
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.50 (d)

Table of Contents

1 Introduction.
2 Preliminaries. 2.1 Circuits. 2.2 Fault Models. 2.3 Simple ATPG Framework. 2.4 Classical ATPG Algorithms. 2.5 Benchmarking.
3 Boolean Satisfiability. 3.1 SAT Solver. 3.2 Advances in SAT.3.3 Circuit-to-CNF Conversion. 3.4 Circuit-oriented SAT.
4 SAT-based ATPG. 4.1 Basic Problem Transformation. 4.2 Structural Information. 4.3 Experimental Results. 4.4 Summary.
5 Learning Techniques. 5.1 Introductory Example. 5.2 Concepts for Reusing Learned Information. 5.3 Heuristics for ATPG. 5.4 Experimental Results. 5.5 Summary.
6 Multiple-valued Logic. 6.1 Four-Valued Logic. 6.2 Multi-input Gates. 6.3 Experimental Results. 6.4 Summary.
7 Improved Circuit-to-CNF Conversion. 7.1 Hybrid Logic. 7.2 Incremental Instance Generation. 7.3 Experimental Results. 7.4 Summary.
8 Branching Strategies. 8.1 Standard Heuristics of SAT Solvers. 8.2 Decision Strategies. 8.3 Experimental Results. 8.4 Summary.
9 Integration into Industrial Flow. 9.1 Industrial Environment. 9.2 Integration of SAT-based ATPG. 9.3 Test Pattern Compactness. 9.4 Experimental Results. 9.5 Summary.
10 Delay Faults. 10.1 Transition Delay. 10.2 Path Delay. 10.3 Encoding Efficiency for Path Delay Faults. 10.4 Incremental Approach. 10.5 Experimental Results. 10.6 Summary.
11 Summary and Outlook.
Bibliography. Index.

Read More Show Less

Customer Reviews

Average Rating 5
( 1 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing 1 Customer Reviews
  • Anonymous

    Posted October 16, 2010

    No text was provided for this review.

Sort by: Showing 1 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)