Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
High-Level VLSI Synthesis
DSS: A Distributed High-Level Synthesis System
IEEE Design & Test
| Hi-index | 0.00 |
A major problem with low-level functional verification of any hierarchical system is the explosion of reachable states created when clocking mechanisms are incorporated into the model. These additional states make verification more difficult, usually to the point that verification at such a low level is not feasible. Transforms have been developed to take a nonhierarchical model with a complex clocking mechanism and generate a provably equivalent model with a single clock. Furthermore, an algorithm has been developed to take a model with a complex clocking mechanism, described as a hierarchical network of modules, and generate a provably equivalent model with a single clock. These transformed models have a reduced state set and can be verified in place of the original models in a fraction of the original time. This allows a synthesis system to generate simpler verification models, while their results are applicable to the original designs.