메뉴 건너뛰기




Volumn 14, Issue 2, 1995, Pages 255-264

Short Papers On Correction of Multiple Design Errors

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL CIRCUITS; COMPUTER SIMULATION; ELECTRIC NETWORK SYNTHESIS; ERROR DETECTION; FINITE AUTOMATA; HEURISTIC METHODS; ITERATIVE METHODS; LOGIC DESIGN; MODIFICATION; SPECIFICATIONS;

EID: 0029254567     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.370421     Document Type: Article
Times cited : (37)

References (29)
  • 1
    • 0024916005 scopus 로고
    • Locating functional errors in logic circuits
    • K. A. Tamura, “Locating functional errors in logic circuits,” in Proc. 26th Design Automat. Conf., 1989, pp. 185–191.
    • (1989) Proc. 26th Design Automat. Conf. , pp. 185-191
    • Tamura, K.A.1
  • 5
    • 0026962074 scopus 로고
    • Locating logic design errors via test generation and don't-care propagation
    • Sept.
    • S.-Y. Kuo, “Locating logic design errors via test generation and don't-care propagation,” 1992 Euro. Design Automat. Conf., Sept. 1992, pp. 466–471.
    • (1992) 1992 Euro. Design Automat. Conf. , pp. 466-471
    • Kuo, S.-Y.1
  • 6
    • 84961257726 scopus 로고
    • ACCORD: Automatic catching and correction of logic design errors in combinational circuits
    • P.-Y. Chung and I. N. Hajj, “ACCORD: Automatic catching and correction of logic design errors in combinational circuits,” 1992 Int. Test Conf., 1992, pp. 742–751.
    • (1992) 1992 Int. Test Conf. , pp. 742-751
    • Chung, P.-Y.1    Hajj, I.N.2
  • 7
    • 0020588405 scopus 로고
    • Formal design verification of digital systems
    • June
    • A. S. Wojcik, “Formal design verification of digital systems,” on Proc. 20th Design Automat. Conf., June 1983, pp. 228–234.
    • (1983) Proc. 20th Design Automat. Conf. , pp. 228-234
    • Wojcik, A.S.1
  • 8
    • 0021477209 scopus 로고
    • Design verification and testing of the WE 32100 CPUs
    • Aug.
    • R. L. Wadsack, “Design verification and testing of the WE 32100 CPUs,” IEEE Design and Test, pp. 66–75, Aug. 1984.
    • (1984) IEEE Design and Test , pp. 66-75
    • Wadsack, R.L.1
  • 10
    • 0022915495 scopus 로고
    • PROTEUS: A logic verification system for combinational circuits
    • Sept.
    • R.-S. Wei and A. L. Sangiovanni-Vincentelli, “PROTEUS: A logic verification system for combinational circuits,” in Proc. Int. Test Conf., Sept. 1986, pp. 350–359.
    • (1986) Proc. Int. Test Conf. , pp. 350-359
    • Wei, R.-S.1    Sangiovanni-Vincentelli, A.L.2
  • 12
    • 0024036029 scopus 로고
    • Formal verification of hardware correctness: Introduction and survey of current research
    • July
    • P. Camurati and P. Prinetto, “Formal verification of hardware correctness: Introduction and survey of current research,” IEEE Trans. Computers, pp. 8–19, July 1988.
    • (1988) IEEE Trans. Computers , pp. 8-19
    • Camurati, P.1    Prinetto, P.2
  • 13
    • 0024029928 scopus 로고
    • On the verification of sequential machines at differing levels of abstraction
    • June
    • S. Devadas, H.-K. T. Ma, and A. R. Newton, “On the verification of sequential machines at differing levels of abstraction,” IEEE Trans. Computer-Aided Design, pp. 713–722, June 1988.
    • (1988) IEEE Trans. Computer-Aided Design , pp. 713-722
    • Devadas, S.1    Ma, H.-K.T.2    Newton, A.R.3
  • 15
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • Aug.
    • R. E. Bryant, “Graph-based algorithms for Boolean function manipulation,” IEEE Trans. Computers, pp. 677–691, Aug. 1986.
    • (1986) IEEE Trans. Computers , pp. 677-691
    • Bryant, R.E.1
  • 17
    • 0025556059 scopus 로고
    • A unified framework for the formal verification of sequential circuits
    • O. Coudert, “A unified framework for the formal verification of sequential circuits,” in Int. Conf. Computer-Aided Design, 1990, pp. 126–129.
    • (1990) Int. Conf. Computer-Aided Design , pp. 126-129
    • Coudert, O.1
  • 19
    • 0025564141 scopus 로고
    • Implicit state transition graphs: applications to sequential logic synthesis and test
    • P. Ashar, A. Ghosh, S. Devadas, and A. R. Newton, “Implicit state transition graphs: applications to sequential logic synthesis and test,” in Int. Conf. Computer-Aided Design, 1990, pp. 84–87.
    • (1990) Int. Conf. Computer-Aided Design , pp. 84-87
    • Ashar, P.1    Ghosh, A.2    Devadas, S.3    Newton, A.R.4
  • 20
    • 0026732532 scopus 로고
    • Fast sequential ATPG based on implicit state enumeration
    • Oct.
    • H. Cho, G. D. Hachtel, and F. Somenzi, “Fast sequential ATPG based on implicit state enumeration,” in 1991 Int. Test Conf., Oct. 1991, pp. 67–74.
    • (1991) 1991 Int. Test Conf. , pp. 67-74
    • Cho, H.1    Hachtel, G.D.2    Somenzi, F.3
  • 21
    • 0026992429 scopus 로고
    • An efficient non-enumerative method to estimate path delay fault coverage
    • Nov.
    • I. Pomeranz and S. M. Reddy, “An efficient non-enumerative method to estimate path delay fault coverage,” in 1992 Int. Conf. Computer-Aided Design, Nov. 1992, pp. 560–567.
    • (1992) 1992 Int. Conf. Computer-Aided Design , pp. 560-567
    • Pomeranz, I.1    Reddy, S.M.2
  • 25
    • 0027882293 scopus 로고
    • A method for diagnosing implementation errors in synchronous sequential circuits and its implications on synthesis
    • Sept.
    • I. Pomeranz and S. M. Reddy, “A method for diagnosing implementation errors in synchronous sequential circuits and its implications on synthesis,” in EURO-DAC '93, Sept. 1993, pp. 252–258.
    • (1993) EURO-DAC '93 , pp. 252-258
    • Pomeranz, I.1    Reddy, S.M.2
  • 27
    • 0026175222 scopus 로고
    • On achieving a complete fault coverage for sequential machines using the transition fault model
    • June
    • I. Pomeranz and S. M. Reddy, “On achieving a complete fault coverage for sequential machines using the transition fault model,” in 28th Design Automat. Conf., June 1991, pp. 341–346.
    • (1991) 28th Design Automat. Conf. , pp. 341-346
    • Pomeranz, I.1    Reddy, S.M.2
  • 28
    • 0024753283 scopus 로고
    • The transduction method—Design of logic networks based on permissible functions
    • Oct.
    • S. Muroga, Y. Kambayashi, H. C. Lai, and J. N. Culliney, “The transduction method—Design of logic networks based on permissible functions,” IEEE Trans. Comput., pp. 1404–1424, Oct. 1989.
    • (1989) IEEE Trans. Comput. , pp. 1404-1424
    • Muroga, S.1    Kambayashi, Y.2    Lai, H.C.3    Culliney, J.N.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.