메뉴 건너뛰기




Volumn 2725, Issue , 2003, Pages 54-66

A work-efficient distributed algorithm for reachability analysis

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

EID: 35248869318     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_5     Document Type: Article
Times cited : (17)

References (19)
  • 7
    • 33748310080 scopus 로고    scopus 로고
    • Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions
    • G. Cabodi. Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions. In Proc. of the 13th Int. Conf. on Computer Aided Verification, 2001.
    • (2001) Proc. of the 13th Int. Conf. on Computer Aided Verification
    • Cabodi, G.1
  • 13
    • 0036851111 scopus 로고    scopus 로고
    • Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits
    • November
    • T. Heyman, D. Geist, O. Grumberg, and A. Schuster. Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits. Formal Methods in System Design, 21(2):317-338, November 2002.
    • (2002) Formal Methods in System Design , vol.21 , Issue.2 , pp. 317-338
    • Heyman, T.1    Geist, D.2    Grumberg, O.3    Schuster, A.4
  • 19
    • 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 33rd Design Automation Conf. IEEE Computer Society Press, 1996.
    • (1996) 33rd Design Automation Conf.
    • Stornetta, T.1    Brewer, F.2


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