Title :
Disjunctive Transition Relation Decomposition for Efficient Reachability Analysis
Author :
Stergiou, Stergios ; Jain, Jawahar
Author_Institution :
Stanford Univ.
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;
Conference_Titel :
High-Level Design Validation and Test Workshop, 2006. Eleventh Annual IEEE International
Conference_Location :
Monterey, CA
Print_ISBN :
1-4244-0680-3
Electronic_ISBN :
1552-6674
DOI :
10.1109/HLDVT.2006.319997
