메뉴 건너뛰기




Volumn 29, Issue 2, 2006, Pages 157-175

A work-efficient distributed algorithm for reachability analysis

Author keywords

Distributed BDDs; Distributed reachability; Symbolic model checking

Indexed keywords

ADAPTIVE ALGORITHMS; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; ENGINEERING RESEARCH; PARALLEL PROCESSING SYSTEMS; RESOURCE ALLOCATION;

EID: 33748306096     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-006-0011-4     Document Type: Article
Times cited : (19)

References (19)
  • 7
    • 84958744374 scopus 로고    scopus 로고
    • Meta-BDDs: A decomposed representation for layered symbolic manipulation of boolean functions
    • LNCS
    • Cabodi G (2001) Meta-BDDs: A decomposed representation for layered symbolic manipulation of boolean functions. In: Proc. of the 13th Int. Conf. on Computer Aided Verification, LNCS
    • (2001) Proc. of the 13th Int. Conf. on Computer Aided Verification
    • Cabodi, G.1
  • 11
    • 84968448732 scopus 로고
    • Efficient model checking by automated ordering of transition relation partitions
    • LNCS 818
    • Geist D, Beer I (1994) Efficient model checking by automated ordering of transition relation partitions. In: Proc. of the Sixth Int. Conf. on Computer Aided Verification, LNCS 818, pp 299-310
    • (1994) Proc. of the Sixth Int. Conf. on Computer Aided Verification , pp. 299-310
    • Geist, D.1    Beer, I.2
  • 13
    • 0036851111 scopus 로고    scopus 로고
    • Achieving scalability in parallel reachability analysis of very large circuits
    • Heyman T, Geist D, Grumberg O, Schuster A (2002) Achieving scalability in parallel reachability analysis of very large circuits. Formal Methods System Design 21(2):317-338
    • (2002) Formal Methods System Design , vol.21 , Issue.2 , pp. 317-338
    • Heyman, T.1    Geist, D.2    Grumberg, O.3    Schuster, A.4


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