Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. J. A. Abraham, and D. D. Gajski: Design of testable structures defined by simple loops. IEEE Trans. on Computers, C-30,No. 11, pp875–884, 1981.
2. B. Becker, and J. Hartmann: Optimal-time multipliers and C-testability. Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures. pp146–154, 1990.
3. B. Becker, and U. Sparmann: Computations over Finite Monoids and their Test Complexity. Theoretical Computer Science, pp225–250, 1991.
4. D. Bhattacharya, and J. P. Hayes: Fast and easily testable implementation of arithmetic functions. Proceedings of the 16th International Symposium on Fault Tolerant Computing Systems, pp324–329, July 1986.
5. J. P. Hayes: On realizations of boolean functions requiring a minimal or near-minimal number of tests. IEEE Trans. on Computers C-20, pp1506–1513, 1971.