메뉴 건너뛰기




Volumn 1855, Issue , 2000, Pages 20-35

Achieving scalability in parallel reachability analysis of very large circuits

Author keywords

[No Author keywords available]

Indexed keywords

AXIAL FLOW; COMPUTER AIDED ANALYSIS; EFFICIENCY; MEMORY ARCHITECTURE; SCALABILITY; TIMING CIRCUITS;

EID: 84944382125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_6     Document Type: Conference Paper
Times cited : (49)

References (11)
  • 4
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
    • (1986) IEEE Transactions on Computers , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 6
    • 0011589477 scopus 로고
    • Verifying Temporal Pro- perties of Sequential Machines Without Building their State Diagrams
    • In R. Kurs- han and E. M. Clarke, editors, American Mathematical Society, Providence, RI
    • Olivier Coudert, Jean C. Madre, and Christian Berthet. Verifying Temporal Pro- perties of Sequential Machines Without Building their State Diagrams. In R. Kurs- han and E. M. Clarke, editors, Workshop on Computer Aided Verification, DI- MACS, pages 75-84. American Mathematical Society, Providence, RI, 1990.
    • (1990) Workshop on Computer Aided Verification, DI- MACS , pp. 75-84
    • Coudert, O.1    Madre, J.C.2    Berthet, C.3
  • 11
    • 0029720349 scopus 로고    scopus 로고
    • Implementation of an efficient parallel bdd package
    • IEEE Computer Society Press
    • T. Stornetta and F. Brewer. Implementation of an efficient parallel bdd package. In Design Automation Conference. IEEE Computer Society Press, 1996.
    • (1996) Design Automation Conference
    • Stornetta, T.1    Brewer, F.2


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