Exact Path Delay Fault Coverage with Fundamental Zero-Suppressed BDD Operations
暂无分享,去创建一个
[1] Kwang-Ting Cheng,et al. Delay testing for non-robust untestable circuits , 1993, Proceedings of IEEE International Test Conference - (ITC).
[2] Christoph Meinel,et al. Linear sifting of decision diagrams , 1996, Universität Trier, Mathematik/Informatik, Forschungsbericht.
[3] Spyros Tragoudas,et al. Improved nonenumerative path-delay fault-coverage estimation based on optimal polynomial-time algorithms , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[4] Spyros Tragoudas,et al. Color counting and its application to path delay fault coverage , 2001, Proceedings of the IEEE 2001. 2nd International Symposium on Quality Electronic Design.
[5] Shin-ichi Minato,et al. Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.
[6] Spyros Tragoudas,et al. ATPG for path delay faults without path enumeration , 2001, Proceedings of the IEEE 2001. 2nd International Symposium on Quality Electronic Design.
[7] B. Kapoor. An efficient method for computing exact path delay fault coverage , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.
[8] Randal E. Bryant. Binary decision diagrams and beyond: enabling technologies for formal verification , 1995, ICCAD.
[9] Vishwani D. Agrawal,et al. The path-status graph with application to delay fault simulation , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[10] Irith Pomeranz,et al. An efficient non-enumerative method to estimate path delay fault coverage , 1992, ICCAD.
[11] Gordon L. Smith,et al. Model for Delay Faults Based upon Paths , 1985, ITC.
[12] Spyros Tragoudas,et al. On the nonenumerative path delay fault simulation problem , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[13] Spyros Tragoudas. Accurate path delay fault coverage is feasible , 1999, International Test Conference 1999. Proceedings (IEEE Cat. No.99CH37034).
[14] Richard Rudell. Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD.
[15] F. Somenzi,et al. Who are the variables in your neighbourhood , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[16] Janak H. Patel,et al. Improving a nonenumerative method to estimate path delay fault coverage , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[17] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[18] Fabio Somenzi,et al. Who are the variables in your neighborhood , 1995, ICCAD.
[19] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.
[20] Spyros Tragoudas,et al. Testing for path delay faults using test points , 1999, Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99).