|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
M. Abramovici and M. A. Breuer, "On Redundancy and Fault Detection in Sequential Circuits," IEEE Trans. on Computers C-28, pp. 864-865 (November 1979).
|
| |
2
|
|
| |
3
|
S. Malik, E. M. Sentovich, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Retiming and Resynthesis: Optimizing Sequential Networks with Combinational Techniques," Proc. lnt'l Workshop on Logic Synthesis (May 1989).
|
| |
4
|
M. Damiani and G. De Micheli, "Synchronous Logic Synthesis: Circuit Specifications and Optimization Algorithms " Proc. Int'l Syrup. on Circuits and Systems, pp. 2556- 2570 (May 1990).
|
| |
5
|
|
| |
6
|
F. Brglez, D. Bryan, and K. Kozaninski, "Combinational Profiles of Sequential Benchmark Circuits," Proc. int'l Syrup. on Circuits and Systems, pp. 1929-1934 (May 1989).
|
| |
7
|
H.-K. T. Ma, S. Devadas, A. R. Newton, and A. Sangiovanni-Vincentelli, "Test Generation for Sequential Circuits," IEEE Trans. on CAD 7, pp. 1081-1093 (October 1988).
|
| |
8
|
A. Ghosh, S. Devadas, and A. R. Newton, "Test Generation for Highly Sequential Circuits," Int'l Conference on Computer-Aided Design, pp. 362-365 (Nov. 1989).
|
| |
9
|
H. Kubo, "A Procedure for Generating Test Sequences to Detect Sequential Circuit Failures," NEC Res. & Dev., pp. 69-78 (October 1968).
|
| |
10
|
G.R. Putzolu and J. P. Roth, "A Heuristic Algorithm for the Testing of Asynchronous Circuits," IEEE Trans. Computers C-20, pp. 639-647 (June 1971).
|
| |
11
|
|
| |
12
|
|
| |
13
|
W.T. Cheng, "The BACK Algorithm for Sequential Test Generation," Proc. Int. Conf. Computer Design (ICCD- 88), Rye Brook, NY, pp. 66-69 (October 1988).
|
| |
14
|
W.-T. Cheng, Private Communication.
|
| |
15
|
M. Abramovici, M. A. Breuer, and A. D. Friedman, Digi. tal Systems Testing and Testable Design, Computer Science Press (1990).
|
| |
16
|
K.T. Cheng and V. D. Agrawal, "State Assignment for Initializable Synthesis," Int'l Conf. on Computer-Aided Design (ICCAD-89), pp. 212-215 (Nov. 1989).
|
| |
17
|
|
| |
18
|
R.M. Karp, "Reducibility between combinatorial problems," Plenum Press, pp. 85-103 (1972). Complexity of Computer Computations, R.E. Miller and J. W. Thatcher, Eds.
|
| |
19
|
J.C. Tieman, "An Efficient Search Algorithm to Find the Elementary Circuits of a Graph," J. ACM 32-2, pp. 296- 313 (April 1985).
|
| |
20
|
D.H. Lee and S. M. Reddy, "On Determining Scan Flip- Flops in Partial-Scan Designs," Int'l Conf. on Computer. Aided Design (ICCAD-90) (Nov. 1990).
|
| |
21
|
|
| |
22
|
W.-T. Cheng and S. Davidson, "Sequential Circuit Test Generator (STG) Benchmark Results," Proc. Int'l Symp. on Circuits and Systems, pp. 1939-1941 (May 1989).
|
CITED BY 16
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Mahesh A. Iyer , David E. Long , Miron Abramovici, Identifying sequential redundancies without search, Proceedings of the 33rd annual conference on Design automation, p.457-462, June 03-07, 1996, Las Vegas, Nevada, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Enrique San Millán , Luis Entrena , José A. Espejo , Silvia Chiusano , Fulvio Corno, Integrating symbolic techniques in ATPG-based sequential logic optimization, Proceedings of the conference on Design, automation and test in Europe, p.105-es, January 1999, Munich, Germany
|
|
|
|
|