Satisfiability on reconfigurable hardware

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1304, Issue , 1997, Pages 448-456

  Abramovici, Miron ^a   Saab, Daniel ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957878228     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63465-7_250     Document Type: Conference Paper

References (20)

1. M. Abramovici, M. A. Breuer and A. D. Friedman, Digital Systems Testing and Testable Design, IEEE Press, 1994
2. M. Abramovici and P. Menon, “Fault Simulation on Reconfigurable Hardware,” Proc. IEEE Symp. on Field-Programmable Custom Computing Machines, April, 1997
3. J. Babb, M. Frank, and A. Agarwal, “Solving graph problems with dynamic computation structures,” in SPIE Photonics East: Reconfigurable Technology for Rapid Product Development & Computing, pp. 225-236, November, 1996
4. R. Brayton, G. Hachtel, C. McMullen, and A. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers, 1984
5. F. Brglez and H. Fujiwara, “Neutral netlist of ten combinational benchmark circuits and a target translator in FORTRAN,” Proc. IEEE Intn’l. Symp. on Circuits and Systems, June 1985.
6. S. T. Chakradhar, V. D. Agrawal, and M. L. Bushnell, “Neural Net and Boolean Satisfiability Models of Logic Circuits,” IEEE Design & Test of Computers, vol. 7, no. 3, pp. 54-57, October, 1990
7. S. T. Chakradhar and V. D. Agrawal, “A Novel VLSI Solution to a Difficult Graph Problem,” Proc. Intn.l. Symp. on VLSI Design, pp. 124-129, January,1990
8. S. A. Cook, “The Complexity of Theorem-Proving Procedures,” Proc. 3rd Annual ACM Symp. on Theory of Computation, pp. 151-158, 1971
9. S. Devadas, K. Keutzer, S. Malik, and A. Wang, “Certified Timing Verification and the Transition Delay of a Logic Circuit,” Proc. Design Automation Confi, pp. 549-555, June, 1992
10. H. Fujiwara and T. Shimono, “On the Acceleration of Test Generation Algorithms,” IEEE Trans, on Computers, vol. C-32, no 12, pp. 1137-1144, December, 1983.
11. P. Goel, “An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits,” IEEE Trans, on Computers, Vol. C-30, No. 3, pp. 215-222, March, 1981.
12. F. Hirose, K. Takayama, and N. Kawato, “A Method to Generate Tests for Combinational Logic Circuits Using an Ultrahigh-speed Logic Simulator,” Proc. Intn’l. Test Conf, pp 102-107, Oct. 1988
13. T. Larrabee, “Test Pattern Generation Using Boolean Satisfiability,” IEEE Trans, on CAD, Vol. 11, No. 1, pp. 4-15, January, 1992
14. P. C. McGeer et al„ ‘Timing Analysis and Delay-Fault Test Generation Using Path Recursive Functions,” Proc. Intn’l. Symp. on CAD, pp. 180-183, November 1991
15. RPM Emulation System Data Sheet, Quicktum Systems Inc., 1991
16. P. R. Stephan, R. K. Brayton, and A. Sangiovanni-Vincentelli, “Combinational Test Generation Using Satisfiability,” IEEE Trans, on CAD, vol. 15, no. 9, pp. 1167-1176, Sept. 1996.
17. T. Suyama, M. Yokoo, and H. Sawada, “Solving Satisfiability Problems on FPGAs,” Proc. Intn’l. Workshop on Field-Programmable Logic and Applications, 1996
18. K. Takayama, F. Hirose, and N. Kawato, “A Test Generation System Using a Logic Simulation Engine,” Fujitsu Sci. Tech. J., vol. 27, no 3, pp. 285-289, Sept. 1991
19. R.G. Wood and R.A. Rutenbar, “FPGA Routing and Routability Estimation Via Boolean Satisfiability”, Proc. Intn’l. Symp. on FPGAs, February 1997
20. Y. Wu and S. Adham, “BIST Fault Diagnosis in Scan-Based VLSI Environments,” Proc. Intn’l. Test Conf, pp. 48-57, October 1996