Artificial intelligence
A topological search algorithm for ATPG
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Dynamic search-space pruning techniques in path sensitization
DAC '94 Proceedings of the 31st annual Design Automation Conference
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
Combinational equivalence checking using satisfiability and recursive learning
DATE '99 Proceedings of the conference on Design, automation and test in Europe
An effective test generation system for sequential circuits
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Reasoning in Boolean Networks: Logic Synthesis and Verification Using Testing Techniques
Reasoning in Boolean Networks: Logic Synthesis and Verification Using Testing Techniques
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
The Propositional Formula Checker HeerHugo
Journal of Automated Reasoning
New Techniques for Deterministic Test Pattern Generation
Journal of Electronic Testing: Theory and Applications
Search State Equivalence for Redundancy Identification and Test Generation
Proceedings of the IEEE International Test Conference on Test: Faster, Better, Sooner
Proceedings of the IEEE International Test Conference on Discover the New World of Test and Design
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Multi-resolution on compressed sets of clauses
ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Combinational test generation using satisfiability
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IGRAINE-an Implication GRaph-bAsed engINE for fast implication, justification, and propagation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
SAT and ATPG: Boolean engines for formal hardware verification
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
| Hi-index | 0.00 |
The problems of Boolean satisfiability (SAT) and automatic test pattern generation (ATPG) are strongly related - both in terms of application areas (premanufacturing design validation and post-manufacturing testing), as well as in terms of techniques used in their practical solutions (searching large combinatorial spaces through efficient pruning). However, historically these domains have evolved somewhat independently with limited interaction. While ATPG has been primarily driven by reasoning based on circuit structure, SAT has forcussed on reasoning using conjunctive form (CNF) representations of Boolean formulas. In this chapter, we introduce these problems, describe key techniques used to solve them in practice, and highlight the common themes and differences between them.