Efficient SAT-Based Search for Longest Sensitisable Paths

@article{Sauer2011EfficientSS,
  title={Efficient SAT-Based Search for Longest Sensitisable Paths},
  author={Matthias Sauer and Jie Jiang and Alexander Czutro and Ilia Polian and Bernd Becker},
  journal={2011 Asian Test Symposium},
  year={2011},
  pages={108-113}
}
We present a versatile method that enumerates all or a user-specified number of longest sensitisable paths in the whole circuit or through specific components. The path information can be used for design and test of circuits affected by statistical process variations. The algorithm encodes all aspects of the path search as an instance of the Boolean Satisfiability Problem (SAT), which allows the method not only to benefit from recent advances in SAT-solving technology, but also to avoid some of… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 27 CITATIONS

Accurate Computation of Sensitizable Paths Using Answer Set Programming

VIEW 8 EXCERPTS
CITES METHODS, RESULTS & BACKGROUND
HIGHLY INFLUENCED

Automatic test pattern generation for delay defects using timed characteristic functions

  • 2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
  • 2013
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Preprint Variation-Aware Deterministic

VIEW 8 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Variation-aware deterministic ATPG

  • 2014 19th IEEE European Test Symposium (ETS)
  • 2014
VIEW 9 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Test Pattern Generation for Approximate Circuits Based on Boolean Satisfiability

  • 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE)
  • 2019
VIEW 1 EXCERPT
CITES BACKGROUND

An effective approach to automatic functional processor test generation for small-delay faults

  • 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE)
  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

SAT-based analysis of sensitisable paths

  • 14th IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems
  • 2011
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Testability-Driven Statistical Path Selection

  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2012
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Combinational test generation using satisfiability

  • IEEE Trans. on CAD of Integrated Circuits and Systems
  • 1996
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Antom — solver description

T. Schubert, M. Lewis, B. Becker
  • SAT Race, 2010.
  • 2010
VIEW 2 EXCERPTS

Similar Papers

Loading similar papers…