• DocumentCode
    1647485
  • Title

    Disjunctive Transition Relation Decomposition for Efficient Reachability Analysis

  • Author

    Stergiou, Stergios ; Jain, Jawahar

  • Author_Institution
    Stanford Univ.
  • fYear
    2006
  • Firstpage
    29
  • Lastpage
    36
  • Abstract
    The applicability of disjunctive transition relation decompositions in the context of symbolic model checking is researched. An algorithm that generates such decompositions is proposed and evaluated on the VIS benchmarks. The obtained decompositions are well-balanced and the algorithm compares well with IWLS´95
  • Keywords
    formal verification; reachability analysis; VIS benchmark; disjunctive transition relation decomposition; reachability analysis; symbolic model checking; Binary decision diagrams; Boolean functions; Circuit simulation; Computational modeling; Conferences; Context modeling; Data structures; Latches; Reachability analysis; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High-Level Design Validation and Test Workshop, 2006. Eleventh Annual IEEE International
  • Conference_Location
    Monterey, CA
  • ISSN
    1552-6674
  • Print_ISBN
    1-4244-0680-3
  • Electronic_ISBN
    1552-6674
  • Type

    conf

  • DOI
    10.1109/HLDVT.2006.319997
  • Filename
    4110056
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1647485