Skip to main content

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 139))

  • 25 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literaturverzeichnis

  1. Äbadir, M.S.; Breuer, M.A.: A knowledge-based system for designing testable chips, IEEE Design & Test of Computers, August 1985, S. 56–68

    Google Scholar 

  2. Äbadir, M.S.; Eeghbati, H.K.: Test generation for LSI: a new approach, University of Saskatchewan, Saskatoon, Canada, Dept. of Computational Science, Research Report 81–7, 1981

    Google Scholar 

  3. Agarwal, V.K.; Fung, A.S.F.: Multiple fault testing of large circuits by single fault test sets, IEEE Trans. CAS., Vol. CAS-28, No. 11 (Nov. 81), S. 1059–1069

    Google Scholar 

  4. Akers, S.B.: Binary decision diagrams, IEEE Trans. C., Vol C-27, No. 6 (June 1978), S. 509–516

    Article  Google Scholar 

  5. Amar, V.; Condulmari, N.: Diagnosis of large combinational nets, IEEE Trans. EC, Vol. EC-16, 1967, S. 675–680

    Google Scholar 

  6. Banerjee, P.B.; Abraham, J.A.: Fault characterization of VLSI MOS circuits, IEEE Proc. ICCC 82, S. 564–568

    Google Scholar 

  7. Batni, R.P.; Kime, Ch.R.: A module-level testing approach for combinational networks, IEEE Trans. C., Vol. C-25 (June 76), S. 594–604

    Google Scholar 

  8. Becker, B.: Efficient testing of optimal-time adders, Universität Saarbrücken, SFB 124 — B1, Intern. Bericht 04/1985

    Google Scholar 

  9. Becker, B.: An easily testable optimal-time VLSI multiplier, Proc. Euro-micro’85, Amsterdam: North-Holland, 1985, S. 401–409

    Google Scholar 

  10. Beh, C.C. et al.: Do stuck fault models reflect manufacturing defects ?, Proc. International Test Conference 1982, S. 35–42

    Google Scholar 

  11. Beister, J.: Formale Hilfsmittel: Entwurf digitaler Schaltungen I A, Skriptum, Institut für Technik der Informationsverarbeitung, 1980

    Google Scholar 

  12. Bennnets, R.G.: Design of testable logic circuits, London: Addison-Wesley, 1984

    Google Scholar 

  13. Blum, N.: Fehlererkennung in kombinatorischen Schaltkreisen, Universität Saarbrücken, FB 10, SFB 124, Bericht 10/1985

    Google Scholar 

  14. Boctor, G.: Ein effizientes algorithmisches Verfahren zur Erstellung von Testmengen für Schaltnetze und Schaltwerke, Universität Karlsruhe, Fakultät für Informatik, Dissertation, 1980

    Google Scholar 

  15. Bossen, D.C.; Hong, S.J.: Cause-effect analysis for multiple fault detection in combinational networks, IEEE Trans. C., Vol. 20, No. 11 (Nov. 1971), S. 1252–1257

    Article  MATH  Google Scholar 

  16. Bochmann, D.; Posthoff, Ch.: Binäre dynamische Systeme, München: R. Oldenbourg Verlag, 1981

    MATH  Google Scholar 

  17. Brayton, R.K.; Cohen, J.D.; Hachtel, G.D.; Trager, B.M.; Yun, D.Y.Y.: Fast recursive boolean function manipulation, Proc. Int. Symp. on Circuits and Systems, May 1982, S. 58–62

    Google Scholar 

  18. Brayton, R.K.; Hachtel, G.D.; McMullen, CT.; Sangiovanni-Vincentelli, A.L.: Logic Minimization Algorithms for VLSI synthesis, Boston: Kluver Academic Publ., 1984

    Book  MATH  Google Scholar 

  19. Bryant, R.E.: Symbolic manipulation of Boolean functions using a graphical representation, Proc. 22nd Design Autom. Conf., 1985, S. 688–694

    Google Scholar 

  20. Breuer, M.A.; Friedman, A.D.: Functional level primitives in test generation, IEEE Trans. C., Vol. C-29, No. 3 (March 1980), S. 223–235

    Article  MathSciNet  Google Scholar 

  21. Breitbart, Y.; Vairavan, K.: The computational complexity of a class of minimization algorithms for switching functions, IEEE Trans. C., Vol. C-28, No. 12 (Dec. 1979), S. 941–943

    Article  MathSciNet  Google Scholar 

  22. Bochmann, D.; Zakrevskij, A.D.; Posthoff, Ch. (Hrsg.): Boolesche Gleichungen, Berlin: VEB Verlag Technik, 1984 (auch Springer-Verlag, Wien)

    Google Scholar 

  23. Camposano, R.; Treff, L.: STRUDEL — Eine Sprache zur Spezifikation der Struktur digitaler Schaltungen, Universität Karlsruhe, Fakultät für Informatik, Interner Bericht Nr. 7/84, Oktober 1984

    Google Scholar 

  24. Cerny, E.: Controllability and fault observability in modular combinational circuits, IEEE Trans. C., Vol. C-27, No.10 (Oct. 78), S. 896–903

    Google Scholar 

  25. Chandramouli, R.: On testing stuck-open faults, Proc. FTCS-13, 1983, S. 258–265

    Google Scholar 

  26. Cha, C.W.: Multiple fault diagnosis in combinational networks, Proc. 16th Design Autom. Conf., 1979, S. 149–155

    Google Scholar 

  27. Chen, Y.: Mehrfach-Literalfehler in logischen Funktionen und Verfahren zur Testerzeugung in Schaltnetzen, Düsseldorf: VDI-Verlag, Dissertation, 1984 (Fortschr. Ber. VDI Reihe 10 Nr. 36)

    Google Scholar 

  28. Cha, Ch.W.; Donath, W.E.; Özgüner, F.: 9-V algorithm for test pattern generation of combinational digital circuits, IEEE Trans. C., Vol. C-27, No.3 (March 1978), S. 193–200

    Article  Google Scholar 

  29. Daehn, W.: Deterministische Testmustergeneratoren für den Selbsttest von integrierten Digitalschaltungen, Universität Hannover, Fakultät für Maschinenwesen, Dissertation, 1983

    Google Scholar 

  30. Davis, B.: The economics of automatic testing, London: McGraw-Hill, 1982

    Google Scholar 

  31. Dershowitz, N.; Hsiang, J.; Josephson, N.A.; Plaisted, D.A.: Associative-commutative rewriting, Proceedings of the Eight Internatinal Joint Conference on Artificial Intelligence (ijcai-83), Vol. 2, 1983, S. 940–944

    Google Scholar 

  32. Dietmeyer, D.L.: Logic design of digital systems, Second Edition, Boston: Allyn and Bacon, 1978

    Google Scholar 

  33. Eastman, Ch. M.: Recent developments in representation in the science of design, Proc. 18th Design Autom. Conf., 1981, S. 13–21

    Google Scholar 

  34. Echtle, K.: Bewertung von Fehlertoleranz-Verfahren für Mehrmikrorechner durch Simulation, in: Tagungsband “Struktur und Betrieb von Rechensystemen”, NTG Fachbericht Band 80, Düsseldorf: VDE-Verlag 1980

    Google Scholar 

  35. Eichelberger, E.B.; Williams, T.W.: A logic design structure for LSI testability, Proc. 14th Design Autom. Conf., 1977, S. 462–468

    Google Scholar 

  36. Fantini, F.; Mattana, G.: Failure mechanisms and analysis of very large scale integrated circuits, Proc. Journees d’Electronique Lausanne, 1983, S. 85–104

    Google Scholar 

  37. Flabb, O.: Fehlerdiagnose an digitalen Schaltungen mit Methoden der Stochastik, RWTH Aachen, Fakultät für Elektrotechnik, Dissertation, 1976

    Google Scholar 

  38. Fujiwara, H.; Shimono, T.: On the acceleration of test generation algorithms, Proc. FTCS-13, 1983, S. 98–105

    Google Scholar 

  39. Faulkner, T.L.; Bartlett, C.W.; Small, M.: Hardware logic design faults. A classification and some measurements —, Proc. FTCS-12, 1982, S. 377–380

    Google Scholar 

  40. Gengel, B.: Maßnahmen zur Vereinfachung des Transfers von Testmustern und Testantworten durch Moduln digitaler integrierter Schaltungen, Universität Karlsruhe, Inst. f. Informatik IV, Diplomarbeit, 1985

    Google Scholar 

  41. Goel, P.: Test generation costs analysis and projections, Proc. 17th Design Autom. Conf., 1980, S. 77–84

    Google Scholar 

  42. Goel, P.: An implicit enumeration algorithm to generate tests for combinational logic circuits, IEEE Trans. C., Vol. C-30, No. 3 (March 1981), S. 215–222

    Article  MathSciNet  Google Scholar 

  43. Görke, W.: Fehlerdiagnose digitaler Schaltungen, Stuttgart: B.G. Teubner, 1973

    MATH  Google Scholar 

  44. Görke, W.: Generating tests for functional expressions, in: Dal Cin, M.; J Dilger, E. (eds.): Self-Diagnosis and Fault-Tolerance, Tübingen: Attempto I Verlag, 1981

    Google Scholar 

  45. Goldstein, L.H.: A probabilistic analysis of multiple faults in LSI circuits, IEEE Computer Society Repository, R77–304, 1977

    Google Scholar 

  46. Görke, W.; Marhöfer, M.: Digitale Fehlerdiagnose, Kurseinheiten 6 und 7 Skriptum, Universität Karlsruhe und GHS Hagen, 1985

    Google Scholar 

  47. Galiay, J.; Crouzet, Y.; Vergniault, M.: Physical versus logical fault models for MOS LSI circuits: impact on their testability, IEEE Trans. C., Vol. C-29, (1980), S. 527–531

    Article  Google Scholar 

  48. Gerner, M.; Görke, W.; Marhöfer, M.: Prüfgerechter Entwurf von ICs, Informatik-Spektrum (1986) 9, H.4, S. 235–246

    Google Scholar 

  49. Hayes, J.P.: A NAND model for fault diagnosis in combinational logic H circuits, IEEE Trans. C., Vol. 20, No. 12 (December 1971), S. 1496–1506

    Article  MathSciNet  MATH  Google Scholar 

  50. Hayes, J.P.: Test generation using equivalent normal forms, Design Autom. and Fault Tol. Computing, 1980, S.131–154

    Google Scholar 

  51. Himmelblau, D.M. (ed.): Decomposition of large-scale problems, Amsterdam: North-Holland, 1973

    MATH  Google Scholar 

  52. Himmelblau, D.M.: Morphology of decomposition, in: Himmelblau, D.M. (ed.): I Decomposition of large-scale problems, Amsterdam: North-Holland, 1973

    Google Scholar 

  53. Hong, S.J.; Cain, R.G.; Ostapko, D.L.: MINI: A heuristic approach for logic minimization, IBM Journal of Res. and Dev., Vol. 18, Sept. 1974, S. 443–458

    Article  MathSciNet  MATH  Google Scholar 

  54. Ibarra, O.H.; Sahni, S.K.: Polynomially complete fault detection problems, IEEE Trans. C., Vol. C-24 (1975), S. 242–249

    Article  MathSciNet  Google Scholar 

  55. Johansson, M.: The GENESYS-algorithm for ATPG without fault simulation, Proc. International Test Conference, 1983, S. 333–337

    Google Scholar 

  56. Kautz, W.H.: Testing faults in cellular logic arrays, Proc. IEEE 8th Ann. Symposium on Switching & Automata Theory, S. 161–174

    Google Scholar 

  57. Klin To: Fault-folding for irredundant and redundant combinational networks, IEEE Trans. C., Vol C-22, No.11 (November 1973), S. 1008–1015

    Article  MathSciNet  Google Scholar 

  58. Koeneman, B.; Mucha, J.; Zwiehoff, G.: Built-in test for complex digital integrated circuits, Proc. International Test Conference, 1979, S. 37–41

    Google Scholar 

  59. Lai, K.-W.: Functional testing of digital systems, Carnegie-Mellon University, Pittsburg, Research Report No. CMU-CS-81–148, Ph. D. Thesis, December 1981

    Google Scholar 

  60. Lala, P.K.: Fault tolerant and fault testable hardware design, London: Prentice-Hall International, 1985

    Google Scholar 

  61. Lepold, R.: Bestimmung der logischen Funktion und der Transparenz digitaler Schaltungen aus einer Strukturbeschreibung, Universität Karlsruhe, Inst. f. Informatik IV, Diplomarbeit, 1985

    Google Scholar 

  62. Levendel, Y.H.; Menon, P.R.: Comparison of fault simulation methods — Treatment of unknown signal values, Journal of Digital Systems, Vol. IV, No. 4, 1981, S. 443–459

    Google Scholar 

  63. Lipp, H.M.: Zur Systematik der Diagramm-Minimisierung, Elektron. Rechenanlagen 11 (1969), H. 5, S. 267–271

    MATH  Google Scholar 

  64. Lutz, H.: Algorithmen für den logischen Entwurf und ihre effiziente Implementierung auf Arbeitsplatzrechnern, Düsseldorf: VDI-Verlag, Dissertation, I 1985 (Fortschr.-Ber. VDI Reihe 10 Nr. 43)

    MATH  Google Scholar 

  65. Lipp, H.M.; Nolle, M.; Sutter, K.: LOGE — Ein leistungsfähiges CAD System zum Entwurf digitaler Steuerungen, Proc. 10th Inter. Cong. Microelectronics, München, 1982

    Google Scholar 

  66. Marhöfer, M.: Entwurf von Testbarkeit bei der Entwicklung hochintegrierter Schaltungen, Arbeitspapier, 21. Juni 1984 (unveröffentlicht)

    Google Scholar 

  67. Marhöfer, M.: Modellierung digitaler Schaltungen für Testanwendungen, Universität Karlsruhe, Fakultät für Informatik, Interner Bericht Nr. 6/84, Juni 1984

    Google Scholar 

  68. Malek, M.; Liu, K.Y.: Graph theory models in fault diagnosis and fault tolerance, Design Autom. & Fault-Tol. Computing, Vol. III, 1979, S. 155–169

    MathSciNet  Google Scholar 

  69. Mead, C.A.: Structural and behavioral composition of VLSI, in: Anceau, F.; Aas, E.J. (eds.): Proc. VLSI’83, Trondheim, 1983, S. 3–8

    Google Scholar 

  70. Michalski, R. et al.: A system of programs for the synthesis of switching circuits using the method of disjoint stars, Proc. IFIP Congress 1971, part TA-2, S. 158–162

    Google Scholar 

  71. Moret, B.M.: Decision trees and diagrams, ACM Computing Surveys, Vol. 14, No. 4 (Dec. 1978), S. 593–623

    Article  Google Scholar 

  72. Muth, P.: A nine-valued circuit model for test generation, IEEE Trans. C., Vol. C-25, No. 6 (June 76), S. 630–636

    Google Scholar 

  73. Nash, J.D.: Bibliography of hardware description languages, ACM SIGDA Newsletter, Vol. 14, No. 1 (Feb. 1984), S. 18–34

    Google Scholar 

  74. Pawlak, A.: A tutorial guide to modern hardware description and design languages, Proc. Euromicro’85, Amsterdam: North-Holland, 1985, S. 507–516

    Google Scholar 

  75. Pauli, M.C.; Unger, S.H.: Minimizing the number of states in incompletly specified sequential switching functions, IRE Trans. on Electronic Comp., EC-8, 9/59, S. 356–366

    Google Scholar 

  76. Petrick, S.: A direct determination of the irredundant forms of a Boolean function from the set of prime implicants, Air Force Research Center, Bedford, MA, Tech. Rept. 56–110, 1956

    Google Scholar 

  77. Roth, J.P.: Algebraical topological methods for the synthesis of switching systems I, Trans. of American Mathematical Society, July 1958, S. 301–326

    Google Scholar 

  78. Roth, J.P.: Diagnosis of automatic failures: a calculus and a method, IBM J. of Res. and Dev., 10 (1966), S. 278–291

    Article  MATH  Google Scholar 

  79. Roth, J.P.: A calculus and an algorithm for the multiple-output 2-level minimization problem, IBM Th.J. Watson Research Center, Yorktown Heigths, N.Y., Research Report RC2007, February 1968

    Google Scholar 

  80. Roth, J.P.: Theory of cubical complexes with application to diagnosis and algorithmic description, IBM Th.J. Watson Research Center, Yorktown Heigths, N.Y., Research Report RC 3675, January 1972

    Google Scholar 

  81. Roth, J.P.: Computer logic, testing and verification, Potomac: Computer Science Press, 1980

    MATH  Google Scholar 

  82. Rudeanu, S.: Boolean functions and equations, Amsterdam: North Holland, 1974

    MATH  Google Scholar 

  83. Savir, J.: Testing for single faults in modular combinational networks, Journal of Design Autom. & Fault Tol. Comp., 3, 1979, S. 69–82

    MathSciNet  Google Scholar 

  84. Baitinger, U.G.; Dermla, A.; Lipp, H.M.; Marhöfer, M.; Mathony, H.-J. (Veranst.): Rechnen mit logischen Ausdrücken und Funktionen, Seminar, Universität Karlsruhe, 1985

    Google Scholar 

  85. Shiva, S.G.: Computer hardware description languages — A tutorial, Proc. of the IEEE, Vol. 67, No. 12 (Dec. 1979), S. 1605–1615

    Article  Google Scholar 

  86. Shen, J.P..; Ferguson, J.: Easily-testable array multipliers, Proc. FTCS--13, 1983, S. 37–40

    Google Scholar 

  87. Sievers, M.; Avizienis, A.: Analysis of a class of totally self-checking functions in a MOS LSI general logic structure, Proc. FTCS-11, 1981, S. 256–261

    Google Scholar 

  88. Siewiorek, D.; Renneis, D.: Workshop Report: Fault-Tolerant VLSI Design, IEEE Computer, December 1980, S. 51–53

    Google Scholar 

  89. Singh, A.K.; Tracey, J.H.: Development of comparsion features for computer hardware description languages, in: Breuer, M.; Hartenstein, R. (eds.): Computer Hardware Description Languages and their Applications, North Holland Publ., 1981, S. 247–263

    Google Scholar 

  90. Somenzi, F.; Gai, S.; Mezzalama, M.; Prinetto, P.: Testing strategy and technique for macro-based circuits, IEEE Trans. C., Vol. C-34, No. 1 (January 1985), S. 85–90

    Article  Google Scholar 

  91. Stefik, M. et al.: The partitioning of concerns in digital system design, Proc. Conf. on Advanced Research on VLSI, M.I.T., 1984, S. 43–52

    Google Scholar 

  92. Steinfoach, B.; Reiß, J.; Fehinel, J.; Voigt, E.: Rechentechnische Erfahrungen mit Booleschen Gleichungen, in: Bochmann, D.; Zakrevskji, A.D.; Posthoff, Ch. (Hrsg.): Boolesche Gleichungen, Berlin: VEB Verlag Technik, 1984

    Google Scholar 

  93. Sutter, K.: Eine Methode zur Konstruktion effizienter Baumalgorithmen für den logischen Entwurf digitaler Einheiten, Düsseldorf: VDI-Verlag, Dissertation, 1985 (Fortschr.-Ber. VDI Reihe 9 Nr. 53)

    Google Scholar 

  94. Su, S.Y.H.; Lin, T.: Functional testing techniques for digital LSI/VLSI systems, Proc. 21th Design Autom. Conf., 1984

    Google Scholar 

  95. Sellers, F.F.; Hsiao, M.Y.; Bearnson, L.W.: Analysing errors with the Boolean difference, IEEE Trans. C., Vol. C-17, 1968, S. 676–683

    Article  Google Scholar 

  96. Sellers, F.F.; Hsiao, M.Y.; Bearnson, L.W.: Corrections to “[SHB68]”, IEEE Trans. C., Vol. C-20, 1971, S. 1245–1251

    Article  Google Scholar 

  97. Shen, J.P.; Maly, W.; Ferguson, F.J.: Inductive fault analysis of MOS integrated circuits, IEEE Design & Test of Computers, December 1985

    Google Scholar 

  98. Tayse, A.: Boolean calculus of differences, Berlin: Springer-Verlag, 1981 (Lect. Notes in Computer Science, Vol. 101)

    Google Scholar 

  99. Thelen, B.: Untersuchungen von Algorithmen für den rechnergestützten logischen Entwurf digitaler Baugruppen, Universität Karlsruhe, Fakultät für Elektrotechnik, Dissertation, 1981

    Google Scholar 

  100. Trischler, E.: An integrated design for testability and automatic test pattern generation system: an overview, Proc. 21th Des. Autom. Conf. 1984, S. 209–215

    Google Scholar 

  101. Wadsack, R.C.: Fault modeling and simulation of CMOS and MOS integrated circuits, Bell Systems Tech. Journal, Vol.57 (May/June 1978), S. 1449–1473

    MATH  Google Scholar 

  102. Williams, T.W.: Design for testability, in: Antognetti, P.; Pederson, D.O.; De Man, H. (eds.): Coputer Design Aids for VLSI Circuits, Sijthoff & Noordhoff, 1981 (Nato Advanced Study Institute Series, Series E: Applied Sciences No. 48)

    Google Scholar 

  103. Williams, M.J.Y.; Angell, J.M.: Enhancing testability of large-scale integrated circuits via test points and additional logic, IEEE Trans. C., Vol. 22, No. 1 (January 1973), S. 46–59

    Article  Google Scholar 

  104. Wunderlich, H.-J.: Zur statistischen Analyse der Testbarkeit digitaler Schaltungen, Universität Karlsruhe, Institut für Informatik IV, Interner Bericht Nr. 18/84, 1984

    Google Scholar 

  105. Wunderlich, H.-J.: Statistical analysis of combinational networks, Arbeitspapier, 1984

    Google Scholar 

  106. Xu, X.; McCluskey, E.J.: Test generation and fault diagnosis for multiple faults in combinational circuits, Proc. FTCS-13, 1983, S. 110–113

    Google Scholar 

  107. Zakrevskij, A.D.: Logische Matrixgleichungen — Theorie und Praxis, in: Bochmann, D.; Zakrevskij, A.D.; Posthoff, Ch. (Hrsg.): Boolesche Gleichungen, Berlin: VEB Verlag Technik 1984

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Marhöfer, M. (1987). Literaturverzeichnis. In: Fehlerdiagnose für Schaltnetze aus Modulen mit partiell injektiven Pfadfunktionen. Informatik-Fachberichte, vol 139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72757-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-72757-3_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17938-2

  • Online ISBN: 978-3-642-72757-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics