|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
H.C. Chen and D. H. Du. Path sensitization in critical path problem. 1990 ACM Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, 1990.
|
| |
2
|
S. Devadas , K. Keutzer , S. Malik , A. Wang, Certified timing verification and the transition delay of a logic circuit, Proceedings of the 29th ACM/IEEE conference on Design automation, p.549-555, June 08-12, 1992, Anaheim, California, United States
|
| |
3
|
S. Devadas, K. Keutzer, and S. Malik. Delay computation in combinational logic circuits: Theory and algorithms. IEEE/ACM International Conference on Computer-AidedDesign, Nov. 1991.
|
| |
4
|
W. Lain, R. Brayton, and A. Sangiovanni-Vincentelli. Circuit delay models and their exact computation using timed boolean functions. UC Berkeley ERL memorandum: UCB/ERL M93/6, Jan. 1993.
|
| |
5
|
W. Lam, R. Brayton, and A. Sangiovanni-Vincentelli. Minimum cycle time of synchronous circuit with bounded delays. UC Berkeley ERL memorandum: UCB/ERL M92/56, May 1992.
|
| |
6
|
|
| |
7
|
|
| |
8
|
P. McGeer, A. Saldanha, P. Stephan, R. Brayton, and A. Sangiovanni-Vince ntelli. Timing analysis and delay-fault test generation using path recursive functions. IEEE International Conference on Computer-Aided Design, pages 180-183, Nov. 1991.
|
CITED BY 8
|
|
William K. C. Lam , Robert K. Brayton , Alberto L. Sangiovanni-Vincentelli, Exact minimum cycle times for finite state machines, Proceedings of the 31st annual conference on Design automation, p.100-105, June 06-10, 1994, San Diego, California, United States
|
|
|
|
|
|
M. Kassab , E. Cerny , S. Aourid , T. Krodel, Propagation of last-transition-time constraints in gate-level timing analysis, Proceedings of the conference on Design, automation and test in Europe, p.796-802, February 23-26, 1998, Le Palais des Congrés de Paris, France
|
|
|
|
|
|
Andreas Jakoby , Rüdiger Reischuk , Christian Schindelhauer, Circuit complexity: from the worst case to the average case, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.58-67, May 23-25, 1994, Montreal, Quebec, Canada
|
|
|
|
|
|
|
|
|
|
|