메뉴 건너뛰기




Volumn 2002-January, Issue , 2002, Pages 151-158

Improving structural FSM traversal by constraint-satisfying logic simulation

Author keywords

Binary decision diagrams; Boolean functions; Circuit simulation; Combinational circuits; Computational efficiency; Computational modeling; Data structures; Electronic design automation and methodology; Formal verification; Logic

Indexed keywords

ALGORITHMS; BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; CIRCUIT SIMULATION; COMBINATORIAL CIRCUITS; COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; COMPUTER AIDED DESIGN; DATA STRUCTURES; FORMAL VERIFICATION; VLSI CIRCUITS;

EID: 84948650869     PISSN: 21593469     EISSN: 21593477     Source Type: Conference Proceeding    
DOI: 10.1109/ISVLSI.2002.1016889     Document Type: Conference Paper
Times cited : (4)

References (16)
  • 3
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • August
    • Randy Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677-691, August 1986.
    • (1986) IEEE Transactions on Computers , vol.35 , Issue.8 , pp. 677-691
    • Bryant, R.1
  • 4
    • 84856140605 scopus 로고
    • Verification of synchronous sequential machines based on symbolic execution
    • June
    • Oliver Coudert, C. Berthet, and Jean-Christophe Madre. Verification of synchronous sequential machines based on symbolic execution. Lecture Notes on Computer Science, 407:365-373, June 1989.
    • (1989) Lecture Notes on Computer Science , vol.407 , pp. 365-373
    • Coudert, O.1    Berthet, C.2    Madre, J.-C.3
  • 9
    • 0027839536 scopus 로고
    • An efficient tool for logic verification based on recursive learning
    • Nov
    • Wolfgang Kunz. An efficient tool for logic verification based on recursive learning. In Proc. Intl. Conference on Computer-Aided Design (ICCAD-93), pages 538-543, Nov. 1993.
    • (1993) Proc. Intl. Conference on Computer-Aided Design (ICCAD-93) , pp. 538-543
    • Kunz, W.1
  • 11
    • 0029720348 scopus 로고    scopus 로고
    • An efficient equivalence checker for combinational circuits
    • June
    • Yusuke Matsunaga. An efficient equivalence checker for combinational circuits. In Proc. Design Automation Conference (DAC-96), pages 629-634, June 1996.
    • (1996) Proc. Design Automation Conference (DAC-96) , pp. 629-634
    • Matsunaga, Y.1
  • 13
    • 0029214437 scopus 로고
    • A novel verification framework combining structural and OBDD methods in a synthesis environment
    • June
    • Subodh Reddy, Wolfgang Kunz, and Dhiraj Pradhan. A novel verification framework combining structural and OBDD methods in a synthesis environment. In Proc. Design Automation Conference (DAC-95), pages 414-419, June 1995.
    • (1995) Proc. Design Automation Conference (DAC-95) , pp. 414-419
    • Reddy, S.1    Kunz, W.2    Pradhan, D.3
  • 15
    • 0031341801 scopus 로고    scopus 로고
    • Record & play: A structural fixed point iteration for sequential circuit verification
    • Nov
    • Dominik Stoffel and Wolfgang Kunz. Record & play: A structural fixed point iteration for sequential circuit verification. In Proc. Intl. Conference on Computer-Aided Design (ICCAD-97), pages 394-399, Nov 1997.
    • (1997) Proc. Intl. Conference on Computer-Aided Design (ICCAD-97) , pp. 394-399
    • Stoffel, D.1    Kunz, W.2


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