Name
Abstract | ||
|---|---|---|
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However, the complexity of computing the set of equivalent state pairs often exceeds that of performing symbolic property checking on the original system. We introduce a fully-automated efficient compositional minimization approach which requires only static analysis. Key to our approach is a heuristic algorithm that identifies components with high reduction potential in a bit-level netlist. We next inject combinational logic which restricts the component's inputs to selected representatives of symbolically-computed equivalence classes thereof. Finally, we use existing transformations to synergistically exploit the dramatic netlist reductions enabled by these input filters. Experiments confirm that our technique is able to efficiently yield substantial reductions on large industrial netlists. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICCAD.2005.1560218 | ICCAD |
Keywords | Field | DocType |
symbolic computation,computational complexity,minimisation,high level synthesis,static analysis,formal verification,heuristic algorithm,redundancy | Transition system,Netlist,Model checking,Computer science,High-level synthesis,Static analysis,Algorithm,Combinational logic,Bisimulation,Formal verification | Conference |
ISSN | ISBN | Citations |
1063-6757 | 0-7803-9254-X | 6 |
PageRank | References | Authors |
0.44 | 18 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fadi A. Zaraket | 1 | 42 | 9.93 |
| Jason Baumgartner | 2 | 313 | 23.36 |
| Adnan Aziz | 3 | 1778 | 149.76 |