Improving the Reachability Analysis Technique by Circuit
|
Abstract:
Implicit reachable state computation can be applied to a wide range of sequential formal verification and logic synthesis problems. Symbolic manipulation with BDDs is one of the most efficient techniques known for the reachability analysis. The technique was first proposed by Coudert et al. in 1989, and was improved later by Touati et al. in 1990. The standard approach chooses the cut of a sequential circuit which consists of the output of all the latches. Choosing a valid cut different from the original one will change the complexity of the reachability analysis. Also the reachability information of the retimed circuit is always possible to be transformed back to that of the original circuit with the standard cut. This project explored the circuit retiming for improving the reachability analysis. 1
Citations
| 744 | Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams – Bryant - 1992 |
| 317 | SIS: A system for sequential circuit synthesis – Sentovich, Singh, et al. - 1992 |
| 139 | Logic Verification using Binary Decision Diagrams in a Logic Synthesis Environment – Malik, Wang, et al. - 1988 |
| 128 | Implicit state enumeration of finite state machines using BDD’s – Touati, Savoj, et al. - 1990 |
| 39 | Verification of Sequential Machines Based on Symbolic Execution – Coudert, Berthet, et al. - 1989 |
| 11 | Test generation for highly sequential circuits – Ghosh, Devadas, et al. - 1989 |
| 11 | Implicit computation of minimumcost feedback-vertex sets for partial scan and other applications – Ashar, Malik - 1994 |
| 5 | Performance Optimization of Pipelined Circuits – Malik, Singh, et al. - 1990 |
| 1 | Optimization of sequential networks with combinational techniques – Malik, Sentovich, et al. - 1991 |
