Design Automation Conference (1988)
Anaheim, CA, USA
June 12, 1988 to June 15, 1988
Sherman , Digital Equipment Corp., Maynard, MA, USA
The author introduces timing requirement analysis and two algorithms for its implementation. The first uses a prioritization scheme to generate an approximate solution, which may result in violation. The second uses a depth-first search to find a solution that does not result in violation. Together, these algorithms are useful for timing-requirement analysis and generation and in pattern-timing generation.
logic design verification, optimised graph, timing requirement analysis, prioritization scheme, depth-first search, pattern-timing generation
Sherman, "Algorithms for timing requirement analysis and generation," Design Automation Conference(DAC), Anaheim, CA, USA, 1988, pp. 724-727.