[[abstract]]Reachability analysis is a fundamental technique in the synthesis,verification of VLSI circuits. This paper presents a novel semi-formal approach which combines the advantages of simulation and formal methods to traverse the state space of the FSMs. We conduct the experiments on a set of ISCAS’89 benchmarks. Compared with a previous work which relies on biased random technique, our approach reaches more states with less CPU time[[fileno]]2030238030028[[department]]資訊工程學
Due to the state-space explosion, many synthesis and verification problems for discrete event system...
ISBN: 8372830959A deep understanding of circuit behaviour is a prerequisite for any verification pro...
Finite State Machines (FSMs) are widely used for analysis and synthesis of hardware designs. In part...
The knowledge of the reachable states of a sequential circuit can dramatically speed up optimization...
State space exploration is often used to prove properties about sequential behavior of Finite State ...
Computing the set of reachable states of a finite state machine is an important component of many pr...
Abstract — We present an algorithm to find an overapproximation of the set of reachable states in a ...
ISBN: 0780366859We present a new symbolic algorithm for reachability analysis in sequential circuits...
This dissertation presents a novel verification technique for analog and mixed signal circuits. Anal...
Representing finite state systems by means of finite state machines is a common approach in VLSI cir...
With ever increasing design sizes, verification becomes the bottleneck in modern design flows. Up to...
NUMBER OF PAGES: xiii+394We use a formal tool to extract Finite State Machines (FSM) based represent...
This thesis has explored how structural techniques can be applied to the problem of formal verificat...
Abstract: "Satisfiability procedures have shown significant promise for symbolic simulation of large...
In this paper we present a new method for computing the approximate reached state set of a finite st...
Due to the state-space explosion, many synthesis and verification problems for discrete event system...
ISBN: 8372830959A deep understanding of circuit behaviour is a prerequisite for any verification pro...
Finite State Machines (FSMs) are widely used for analysis and synthesis of hardware designs. In part...
The knowledge of the reachable states of a sequential circuit can dramatically speed up optimization...
State space exploration is often used to prove properties about sequential behavior of Finite State ...
Computing the set of reachable states of a finite state machine is an important component of many pr...
Abstract — We present an algorithm to find an overapproximation of the set of reachable states in a ...
ISBN: 0780366859We present a new symbolic algorithm for reachability analysis in sequential circuits...
This dissertation presents a novel verification technique for analog and mixed signal circuits. Anal...
Representing finite state systems by means of finite state machines is a common approach in VLSI cir...
With ever increasing design sizes, verification becomes the bottleneck in modern design flows. Up to...
NUMBER OF PAGES: xiii+394We use a formal tool to extract Finite State Machines (FSM) based represent...
This thesis has explored how structural techniques can be applied to the problem of formal verificat...
Abstract: "Satisfiability procedures have shown significant promise for symbolic simulation of large...
In this paper we present a new method for computing the approximate reached state set of a finite st...
Due to the state-space explosion, many synthesis and verification problems for discrete event system...
ISBN: 8372830959A deep understanding of circuit behaviour is a prerequisite for any verification pro...
Finite State Machines (FSMs) are widely used for analysis and synthesis of hardware designs. In part...