Name
Abstract | ||
|---|---|---|
This work proposes a technique to automatically obtain timing constraints for a given timed circuit to operate correctly. A designated set of delay parameters of a circuit are first set to sufficiently large bounds, and verification runs followed by failure analysis are repeated. Each verification run performs timed state space enumeration under the given delay bounds, and produces a failure trace if it exists. The failure trace is analyzed, and sufficient timing constraints to prevent the failure is obtained. Then, the delay bounds are tightened according to the timing constraints by using an ILP (Integer Linear Programming) solver. This process terminates when either some delay bounds under which no failure is detected are found or no new delay bounds to prevent the failures can be obtained. The experimental results using a naive implementation show that the proposed method can efficiently handle asynchronous benchmark circuits and nontrivial GasP circuits. |
Year | Venue | Keywords |
|---|---|---|
2002 | CAV | asynchronous benchmark circuit,nontrivial gasp circuit,automatic derivation,delay bound,timing constraints,sufficient timing constraint,verification run,delay parameter,new delay,failure trace,failure analysis,timing constraint,state space |
DocType | ISBN | Citations |
Conference | 3-540-43997-8 | 12 |
PageRank | References | Authors |
0.72 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomohiro Yoneda | 1 | 353 | 41.62 |
| Tomoya Kitai | 2 | 12 | 1.73 |
| Chris J. Myers | 3 | 607 | 75.73 |